ATEM 2006 SI paper:
Learning Context-Free Grammar Rules from a Set of Program

Alpana Dubey, Pankaj Jalote, Shubhani Aggarwal

DOI: 10.1049/iet-sen:20070061
T5B: Language Description Analysis
- The core task is inferring missing context-free grammar rules (grammar completion) from program samples and an approximate grammar.
T2A: Lifecycle
- It targets reverse engineering of dialect grammars when documentation/manuals are missing, i.e., recovery of language definitions.
T5E: Empirical Evaluation
- The approach is experimentally verified on multiple programming languages to demonstrate feasibility and effectiveness.
T3A: Meta-languages
- The inferred artefacts are CFG rules, i.e., meta-language objects used to define and generate parsers.

The page is maintained by Dr. Vadim Zaytsev a.k.a. @grammarware. Last updated: June 2026.