Mario Schkolnick
Abstract
The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages.
- 1 Eickel, J., Paul, M., Bauer, F.L., and Samelson, K. A syntax controlled generator of formal language processors. Comm. ACM 6, 8 (Aug. 1963), 451-455. Google Scholar
Digital Library
- 2 Wirth, N., and Weber, H. EULER.: A generalization of ALGOL, and its formal definition: Part I. Comm. ACM 9, 1 (Jan. 1966), 13-23. Google ScholarDigital Library
- 3 Morris, J.B. A result on the relationship between Simple Precedence Languages and Reducing Transition Languages. Proc. Symp. on Theory of Computing, ACM, May 1970, pp. 73-80. Google ScholarDigital Library
- 4 Aho, A.V., and Ullman, J.D. The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, N.J., 1972, 3. Google ScholarDigital Library
- 5 Ginsburg, S. The Mathematical Theory of Context-Free Languages. McGraw Hill, New York, 1966. Google ScholarDigital Library
- 6 Aho, A.V., Denning, P.J., and Ullman, J.D. Weak and mixed strategy precedence parsing. J. ACM, 19, 2 (Apr, 1972), 225-243. Google ScholarDigital Library
- 7 Fischer, M.J. Some properties of Precedence Languages. Proc. Symp. on Theory of Computing, ACM, May 1969, pp. 181-190. Google ScholarDigital Library
Index Terms
- The equivalence of reducing transition languages and deterministic languages
Recommendations
A result on the relationship between simple precedence languages and reducing transition languages
STOC '70: Proceedings of the second annual ACM symposium on Theory of computingTwo of the more recently published systems for the efficient parsing of subclasses of deterministic, context-free languages are the backwards-deterministic, (or unambiguous, as they were originally called) simple precedence languages due to Wirth and ...
Languages as libraries
PLDI '11Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...
Languages as libraries
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationProgramming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...
Comments