[1] A. V. Aho J. D. Ullman: The Theory of Parsing, Translation, and Compiling. Vol. I: Parsing. Prentice-Hall, 1972. MR 0408321

[2] A. J. Demers: Skeletal LR parsing. 15th Annual Symposium on Switching and Automata Theory 1974, 185-198. MR 0426507

[3] N. El Djabri: Extending the LR Parsing Techniques to Some Non-LR Grammars. TR-121, Princeton University, New Jersey 1973.

[4] M. J. Fischer: Some properties of precedence languages. 1st Annual ACM Symposium on Theory of Computing 1969, 181-190.

[5] J. N. Gray: Precedence Parsers for Programming Languages. Ph. D. Thesis, Department of Computer Science, University of California, Berkeley 1969.

[6] D. S. Henderson M. R. Levy: An extended operator-precedence parsing algorithm. Comput. J. 19 (1976), 3, 229-233. MR 0449038

[7] D. Knuth: Top down syntax analysis. Acta Informatica I (1971), 2, 79-110.

[8] M. R. Levy: Complete operator precedence. Information Processing Lett. 4 (1975), 2, 38-40. MR 0502298 | Zbl 0322.68055

[9] R. Mc Naughton: Paranthesis grammars. J. Assoc. Comput. Mach. 14 (1967), 3, 490-500. MR 0234781

[10] M. C. Paull S. H. Unger: Structural equivalence of context-free grammars. J. Comput. System Sci. 2 (1968), 1, 427-463. MR 0241203

[11] P. Růžička: Validity test for Floyd's operator-precedence parsing algorithms. In: Mathematical Foundations of Computer Science (J. Bečvář, ed.), Lecture Notes in Computer Science 74. Springer-Verlag, Berlin 1979, 415-424. Zbl 0412.68082