J. C. H. Park
Abstract
A new formalism pertaining to LALR analysis is described which serves the dual purpose of providing efficient algorithms and of facilitating their correctness proofs.
- Aho, A. V. and J. D. Ullman, "The Theory of Parsing, Translation, and Compiling," Prentice-Hall, Englewood Cliff, N.J., Vol. 1 1972, Vol. 2 1973. Google Scholar
Digital Library
- Aho, A. V. and J. D. Ullman, "Principle of Compiler Design," Addison-Wesley, 1977. Google ScholarDigital Library
- Aho, A. V., "Translator Writing Systems: Where Do They Now Stand?" IEEE Comp., Vol. 13, No. 8 Aug. 1980, pp. 9--14.Google ScholarDigital Library
- DeRemer, F. L., "Practical Translator for LR(k) Languages," Ph.D. Thesis, MIT, Cambridge, Mass., Sep. 1969.Google Scholar
- DeRemer F. L., "Simple LR(k) Grammars," Comm. ACM, Vol. 14, No. 7 July 1971, pp. 453--460. Google ScholarDigital Library
- DeRemer, F. L. and T. J. Pennello, "Efficient Computation of LALR(1) Look-ahead Sets," ACM SIGPLAN Notice, Vol. 14, No. 12, Dec. 1980, pp. 176--187. Google ScholarDigital Library
- Knuth, D. E., "On the Translation of Language from Left to Right," Information and Control, Vol. 8, No6. Dec. 1965, pp. 607--635.Google ScholarCross Ref
- Kristensen, B. B. and O. L. Madsen, "Method for Computing LALR(k) Lookahead," ACM Trans. on Programming Language and System, Vol. 3, No. 1, Jan. 1981, pp. 60--82. Google ScholarDigital Library
- Lalonde, W. R., "An efficient LALR Parser Generator," Tech. Report, CSRG-2, University of Toronto, 1971.Google Scholar
- Park, J. C. H., C. H. Chang, K. M. Choe, S. M. Oh, and J. W. Yoo, "PGS81-An Efficient LR Parser Generating System", CSRC Technical Report TR81-0001-0, Computer Science Research Center, Korea Advanced Institute of Science and Technology, Seoul, Korea, July 1981.Google Scholar
- Tarjan, R. E., "Depth First Search and Linear Graph Algorithm," SIAM J. Computing 1:2, 1972, pp. 146--160.Google ScholarCross Ref
Recommendations
Noncanonical LALR(1) parsing
DLT'06: Proceedings of the 10th international conference on Developments in Language TheoryThis paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we present a definition of noncanonical LALR(1) parsers, NLALR(1). The class ...
TAG's as a grammatical formalism for generation
HLT '86: Proceedings of the workshop on Strategic computing natural languageTree Adjoining Grammars, or "TAG's", (Joshi, Levy & Takahashi 1975; Joshi 1983; Kroch & Joshi 1985) were developed as an alternative to the standard syntactic formalisms that are used in theoretical analyses of language. They are attractive because they ...
TAGs as a grammatical formalism for generation
ACL '85: Proceedings of the 23rd annual meeting on Association for Computational LinguisticsTree Adjoining Grammars, or "TAG's", (Joshi, Levy & Takahashi 1975; Joshi 1983; Kroch & Joshi 1985) were developed as an alternative to the standard syntactic formalisms that are used in theoretical analyses of language. They are attractive because they ...
Comments