Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Incremental generation of parsers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A survey of adaptable grammars
ACM SIGPLAN Notices
Generation and recognition of formal languages by modifiable grammars
ACM SIGPLAN Notices
On the modification of the formal grammar at parse time
ACM SIGPLAN Notices
Theory and Practice of Compiler Writing
Theory and Practice of Compiler Writing
Formal languages and their relation to automata
Formal languages and their relation to automata
Adaptive automata for context-dependent languages
ACM SIGPLAN Notices
Multibox Parsers: No More Handwritten Lexical Analyzers
IEEE Software
Adaptive Rule-Driven Devices - General Formulation and Case Study
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Parallel simulation of orography influence on large-scale atmosphere motion on APEmille
Proceedings of the 1st conference on Computing frontiers
Automatic Translation in Two Phases: Recognition and Interpretation
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Exploiting dynamicity for the definition and parsing of context sensitive grammars
CONTEXT'03 Proceedings of the 4th international and interdisciplinary conference on Modeling and using context
Adaptable parsing expression grammars
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
| Hi-index | 0.00 |
We define "evolving grammars" as successions of static grammars and dynamic parsers as parsers able to follow the evolution of a grammar during the source program parsing. A growing context-free grammar will progressively incorporate production rules specific for the source program under parsing and will evolve following the context created by the source program itself toward a program specific context-free grammar. Dynamic parsers and growing grammars allow a syntactic-only parsing of programs written in powerful and problem adaptable programming languages. Moreover dynamic parsers easily perform purely syntactic strong type checking and operator overloading. The language used to specify grammar evolution and residual semantic actions can be the evolving language itself. The user can introduce new syntactic operators using a bootstrap procedure supported by the previously defined syntax.A dynamic parser ("ZzParser") has been developed by us and has been successfully employed by the APE 100 INFN group to develop a programming language ("ApeseLanguage") and other system software tools for the 100 GigaFlops SIMD parallel machine under development.