Epsilon weak precedence grammars and languages
Masoud T. Milani; David A. Workman
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)
- Volume: 24, Issue: 3, page 241-266
- ISSN: 0988-3754
Access Full Article
top
How to cite
topMilani, Masoud T., and Workman, David A.. "Epsilon weak precedence grammars and languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.3 (1990): 241-266. <http://eudml.org/doc/92358>.
@article{Milani1990,
author = {Milani, Masoud T., Workman, David A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {precedence grammars; deterministic context-free languages},
language = {eng},
number = {3},
pages = {241-266},
publisher = {EDP-Sciences},
title = {Epsilon weak precedence grammars and languages},
url = {http://eudml.org/doc/92358},
volume = {24},
year = {1990},
}
TY - JOUR
AU - Milani, Masoud T.
AU - Workman, David A.
TI - Epsilon weak precedence grammars and languages
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 3
SP - 241
EP - 266
LA - eng
KW - precedence grammars; deterministic context-free languages
UR - http://eudml.org/doc/92358
ER -
References
top- 1. A. V. AHO, P. J. DENNING and J. D. ULLMAN, Weak and Mixed Strategy Parsing, J. A.C.M., Vol. 19, (2), 1972, pp. 225-243. Zbl0252.68045MR309362
- 2. A. V. AHO and J. D. ULLMAN, TheTheory of Parsing, Translation and Compiling: Vols. 1 and 2, Prentice-Hall, Englewwod Clifffs, N.J., 1972. MR408321
- 3. M. J. FISCHER, Some Properties of Precedence Languages, Proc. A.C.M. Symposium on Theory of Computing, 1969, pp. 181-190. Zbl1282.68148
- 4. R. W. FLOYD, Bounded Context Syntactic Analysis, Comm. A.C.M., Vol. 7, (2), 1964, pp. 62-67. Zbl0123.12601
- 5. S. L. GRAHAM, Extended Precedence Languages, Bounded Right Context Languages and Deterministic Languages, I.E.E.E. Conference Record of the 11th Annual Symposium on Switching and Automata Theory, 1970, pp. 175-180.
- 6. J. N. GRAY, Precedence Parsers for Programming Languages, Ph. D. Dissertation, Dept. of Computer Science, Univ. of California, Berkeley, 1969.
- 7. M. A. HARRISON and I. M. HAVEL, Strict Deterministic Languages, J. Comput. Syst. Sci., Vol. 7, 1973, pp. 237-277. Zbl0261.68036MR319415
- 8. M. A. HARRISON and A. YEHUDAI, A Hierarchy of Deterministic Languages, J. Comput. Syst. Sci., Vol. 19, 1979, pp. 63-78. Zbl0426.68067MR546234
- 9. J. D. ICHBIAH and S. P. MORSE, A Technique for Generating Almost Optimal Floyd-Evans Productions for Precedence Grammars, Comm. A.C.M., Vol. 13, (8), 1970, pp. 501-508. Zbl0205.19002
- 10. D. E. KNUTH, On the Translation of Languages from Left to Right, Info. Contr., Vol. 8, (6), pp. 607-639. Zbl0231.68027MR189942
- 11. Y. KREVNER and A. YEHUDAI, An Iteration Theorem for Simple Precedence Languages, J.A.C.M., Vol. 30, (4), 1983, pp. 820-833. Zbl0628.68060MR819132
- 12. R. KURKI-SUONIO, Note on Top Down Languages, B.I.T., Vol. 9, 1969, pp. 225-238. Zbl0187.27905
- 13. W. M. MCKEEMAN, J. J. HORNING and D. B. WORTMAN, A Compiler Generator, Prentice-Hall, Englewood Cliffs, N.J., 1970.
- 14. A. NIJHOLT, Parsing Strategies: A Concise Survey, Mathematical Foundations of Computer Science, LNCS 118, 1981, pp. 103-120 Springer Berlin. Zbl0461.68085MR652996
- 15. N. WIRTH and H. WEBER, EULER-A Generalization of ALGOL and its Formal Definition, Parts 1 and 2, Comm. A.C.M., Vol 9, (1), 1966, pp. 13-23 and Vol. 9, (2), 1966, pp. 89-99. Zbl0141.14302
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.