Generation and recognition of formal languages by modifiable grammars-Reference-Cited by-同舟云学术

Generation and recognition of formal languages by modifiable grammars

Published:1990-12 Issue:12 Volume:25 Page:45-53
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Burshteyn Boris¹

Affiliation:

1. Pyramid Technology Corporation, 1295 Charleston Road, P.O. Box 7295, Mountain View, CA

Abstract

In this article the formal definitions of modifiable grammars are presented, and the equivalence between classes of modifiable grammars and Turing machines is proved. Some criteria for reducing modifiable grammars to context-free grammars are provided. A lazy LR(1) algorithm for context-free grammars and an algorithm for constructing a LR(1) parser for modifiable grammars are discussed.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/122193.122196

Reference10 articles.

1. [ 1 ] John E. Hopcroft Jefrey D. Ullman. "Introduction to automata theory Languages and Computation" Addison-Wesley (1979). [1] John E. Hopcroft Jefrey D. Ullman. "Introduction to automata theory Languages and Computation" Addison-Wesley (1979).

2. Incremental generation of parsers

3. On the modification of the formal grammar at parse time

4. Efficient full LR(I) parser generation

5. Higher order attribute grammars

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The formalization and implementation of Adaptable Parsing Expression Grammars;Science of Computer Programming;2014-12

2. Adaptable Parsing Expression Grammars;Programming Languages;2012

3. Modern Approaches to Software Engineering in the Compositional Era;Machine Learning;2012

4. Adaptive Technology and Its Applications;Machine Learning;2012

5. π;ACM SIGPLAN Notices;2009-10-25