Grammatical abstraction and incremental syntax analysis in a language-based editor
- 1 June 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 185-198
- https://doi.org/10.1145/53990.54009
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Efficient algorithms for automatic construction and compactification of parsingACM Transactions on Programming Languages and Systems, 1987
- An algorithm for generating abstract syntax treesComputer Languages, 1985
- Metal: a formalism to specify formalismsScience of Computer Programming, 1983
- Building friendly parsersPublished by Association for Computing Machinery (ACM) ,1982
- The Cornell program synthesizerCommunications of the ACM, 1981
- Context-free grammars: Covers, normal forms, and parsingPublished by Springer Nature ,1980
- Regular right part grammars and their parsersCommunications of the ACM, 1977
- The covering problem for linear context-free grammarsTheoretical Computer Science, 1976
- Deterministic parsing of ambiguous grammarsCommunications of the ACM, 1975
- On the Covering and Reduction Problems for Context-Free GrammarsJournal of the ACM, 1972