Faizan Javed
ABSTRACT
We propose a new application area for grammar inference which intends to make domain-specific language development easier and finds a second application in renovation tools for legacy systems. We use the genetic programming approach for grammatical inference and propose the use of frequent sequences, syntax graphs and incremental construction of grammars in order to be able to infer a more comprehensive set of context-free grammars.
- Crepinšek, M., Mernik, M., Bryant, B.R., Javed, F., and Sprague, A. Inferring Context-Free Grammars for Domain-Specific Languages, LDTA 2005,, pp. 64 -- 81, 2005Google Scholar
- Cichello, O., and Kremer, S. C. Inducing Grammars from Sparse Data Sets: A Survey of Algorithm and Results. JMLR, Vol. 4, pp. 603 -- 632, 2003, MIT Press. Google ScholarDigital Library
- Gold, E. M. Language Identification in the Limit. Information and Control, 10:447--474, 1967.Google ScholarCross Ref
- Han, J., and Kamber, M., Data Mining: Concepts and Techniques, Morgan-Kaufmann Publishers, 2001. Google ScholarDigital Library
- Lämmel, R., and Verhoef, C. Semi-automatic grammar recovery. Software -- Practice & Experience, 31(15):1395--1438, December 2001. Google ScholarDigital Library
- Langdon, W.B., Genetic Programming and Data Structures, Kluwer Academic Publishers, 1998. Google ScholarDigital Library
- Mernik, M., Lenic, M., Avdicausevic, E., Žumer, V., LISA: An Interactive Environment for Programming Language Development, 11th International Conference on Compiler Construction, CC'2002, LNCS, Vol. 2304, pp. 1 -- 4, 2002. Google ScholarDigital Library
- van Deursen, A., Klint, P., and Visser, J. Domain-Specific Languages: An Annotated Bibliography. ACM SIGPLAN Notices, 35(6):26--36, 2000. Google ScholarDigital Library
Index Terms
- Inferring context-free grammars for domain-specific languages
Recommendations
Inferring context-free grammars for domain-specific languages
OOPSLA '05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsWe propose a new application area for grammar inference which intends to make domain-specific language development easier and finds a second application in renovation tools for legacy systems. We use the genetic programming approach for grammatical ...
Inferring Context-Free Grammars for Domain-Specific Languages
In the area of programming languages, context-free grammars (CFGs) are of special importance since almost all programming languages employ CFG's in their design. Recent approaches to CFG induction are not able to infer context-free grammars for general-...
Length synchronization context-free grammars
We propose a new type of regulation on the derivation of a context-free grammar: the productions used for passing from a level of a derivation tree to the next level should have the right-hand members of the same length. We prove that such length ...
Comments