Automatic extension of editing rules for program analysis during creation process

This paper focuses on edits of a program that a programming learner is creating. The proposed method in this paper defines EAST (Extended Abstract Syntax tree), an extension of AST (Abstract Syntax Tree), to analyze programs subject to non-compilable edits. EAST adds editing rules to ASTs, and the p...

Full description

Saved in:
Bibliographic Details
Published in:2022 13th International Congress on Advanced Applied Informatics Winter (IIAI-AAI-Winter) pp. 62 - 65
Main Authors: Hashimoto, Wakana, Amano, Yo, Takeuchi, Kazuhiro
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.12.2022
Subjects:
abstract syntax tree
Behavioral sciences
e-learning
Grammar
Informatics
program learning
Programming
Proposals
Syntactics
user behavior modeling
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper focuses on edits of a program that a programming learner is creating. The proposed method in this paper defines EAST (Extended Abstract Syntax tree), an extension of AST (Abstract Syntax Tree), to analyze programs subject to non-compilable edits. EAST adds editing rules to ASTs, and the proposed method automatically creates them from a given set of ASTs. EAST helps define the learner's program editing behavior as editing on a tree structure. The proposals in this paper provide a foundation for future research that will contribute to a more detailed study of improving the learning efficiency of program learners.
DOI:10.1109/IIAI-AAI-Winter58034.2022.00022