Epsilon weak precedence grammars and languages
Milani, Masoud T. ; Workman, David A.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990), p. 241-266 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1990-01-01
@article{ITA_1990__24_3_241_0,
     author = {Milani, Masoud T. and Workman, David A.},
     title = {Epsilon weak precedence grammars and languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {24},
     year = {1990},
     pages = {241-266},
     mrnumber = {1072993},
     zbl = {0701.68066},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1990__24_3_241_0}
}

Milani, Masoud T.; Workman, David A. Epsilon weak precedence grammars and languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) pp. 241-266. http://gdmltest.u-ga.fr/item/ITA_1990__24_3_241_0/

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. | MR 309362 | Zbl 0252.68045

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. | MR 408321

3. M. J. Fischer, Some Properties of Precedence Languages, Proc. A.C.M. Symposium on Theory of Computing, 1969, pp. 181-190.

4. R. W. Floyd, Bounded Context Syntactic Analysis, Comm. A.C.M., Vol. 7, (2), 1964, pp. 62-67. | Zbl 0123.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. | MR 319415 | Zbl 0261.68036

8. M. A. Harrison and A. Yehudai, A Hierarchy of Deterministic Languages, J. Comput. Syst. Sci., Vol. 19, 1979, pp. 63-78. | MR 546234 | Zbl 0426.68067

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. | Zbl 0205.19002

10. D. E. Knuth, On the Translation of Languages from Left to Right, Info. Contr., Vol. 8, (6), pp. 607-639. | MR 189942 | Zbl 0231.68027

11. Y. Krevner and A. Yehudai, An Iteration Theorem for Simple Precedence Languages, J.A.C.M., Vol. 30, (4), 1983, pp. 820-833. | MR 819132 | Zbl 0628.68060

12. R. Kurki-Suonio, Note on Top Down Languages, B.I.T., Vol. 9, 1969, pp. 225-238. | Zbl 0187.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. | MR 652996 | Zbl 0461.68085

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. | Zbl 0141.14302