no. 3
Epsilon weak precedence grammars and languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 3, pp. 241-266. 
@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},
     pages = {241--266},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {3},
     year = {1990},
     mrnumber = {1072993},
     zbl = {0701.68066},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1990__24_3_241_0/}
}
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
SP  - 241
EP  - 266
VL  - 24
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1990__24_3_241_0/
LA  - en
ID  - ITA_1990__24_3_241_0
ER  - 
%0 Journal Article
%A Milani, Masoud T.
%A Workman, David A.
%T Epsilon weak precedence grammars and languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 241-266
%V 24
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1990__24_3_241_0/
%G en
%F 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) no. 3, pp. 241-266. http://archive.numdam.org/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 | Zbl

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

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

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

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

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

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

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

12. R. Kurki-Suonio, Note on Top Down Languages, B.I.T., Vol. 9, 1969, pp. 225-238. | Zbl

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

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