Author:
Cabasino S.,Paolucci Pier S.,Todesco G. M.
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference13 articles.
1. On the modification of the formal grammar at parse time
2. A survey of adaptable grammars
3. Generation and recognition of formal languages by modifiable grammars
4. Incremental generation of parsers
5. [L1] Hopcroft J.E. and Ullman J.D.: "Formal Languages and their relation to automata" Mass. Addison-Wesley (1969). [L1] Hopcroft J.E. and Ullman J.D.: "Formal Languages and their relation to automata" Mass. Addison-Wesley (1969).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献