Transition diagrams and strict deterministic grammars-Reference-Cited by-同舟云学术

Transition diagrams and strict deterministic grammars

Published:1979 Issue: Volume: Page:113-123
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Friede Dietmar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-09118-1_13.pdf

Reference14 articles.

1. Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing, Prentice Hall, Englewood Cliffs, New York, 1972.

2. Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 2: Compiling, Prentice Hall, Englewood Cliffs, New York, 1973.

3. Conway, M.E., Design of a seperable transition diagram compiler, Communication of the ACM Vol. 6, Nr. 7, S. 396–400, New York, 1963.

4. Friede, D., Uber determistisch kontextfreie Sprachen und rekursiven Abstieg, Bericht Nr. 49 des Fachbereich Informatik der Universität Hamburg, 1978.

5. Geller, M.M, Harrison, M.A., Strict Deterministic versus LR(0) Parsing, Conference Record of ACM Symposium on Principles of Programming Languages, 1973.

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

1. On the relationship between the LL(k) and LR(k) grammars;Information Processing Letters;1982-10

2. Parsing strategies: A concise survey;Lecture Notes in Computer Science;1981

3. Ll-regular grammars;International Journal of Computer Mathematics;1980-01

4. Conception et optimisation des descentes recursives;Lecture Notes in Computer Science;1980

5. Partitioned LL(k) grammars;Automata, Languages and Programming;1979