lex & yacc (2nd ed.)
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
Building domain-specific embedded languages
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Journal of the ACM (JACM)
Graphical represenation and graph transformation
ACM Computing Surveys (CSUR)
An efficient context-free parsing algorithm
Communications of the ACM - Special 25th Anniversary Issue
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Automatic information extraction from large websites
Journal of the ACM (JACM)
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
When and how to develop domain-specific languages
ACM Computing Surveys (CSUR)
Adaptive information extraction
ACM Computing Surveys (CSUR)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
Corpus-based induction of syntactic structure: models of dependency and constituency
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Towards the generation of a text-based IDE from a language metamodel
ECMDA-FA'07 Proceedings of the 3rd European conference on Model driven architecture-foundations and applications
Domain Specific Languages
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
A model-driven parser generator with reference resolution support
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Hi-index | 0.00 |
Typically, formal languages are described by providing a textual BNF-like notation specification, which is then manually annotated for syntax-directed translation. When the use of an explicit model is required, its implementation requires the development of the conversion steps between the model and the grammar, and between the parse tree and the model instance. Whenever the language specification is modified, the developer has to manually propagate changes throughout the entire language processor pipeline. These updates are time-consuming, tedious, and error-prone. Besides, in the case that different applications use the same language, the developer has to maintain several copies of the same language specification. In this paper, we introduce a model-based parser generator that decouples language specification from language processing, hence avoiding many of the problems caused by grammar-driven parsers and parser generators.