An efficient context-free parsing algorithm with semantic actions
As M. Tomita  has demonstrated, the LR parsing algorithm can be extended so that it will handle acyclic context-free grammars in a very efficient way, producing a parse forest, a set of all possible parsing trees for a given input sentence. In this paper we aim to show how Tomita's parsing algorithm can be extended to support semantic actions, that is, procedural segments associated with grammar production rules, that are executed contextually during the parsing procedure.
Key wordscomputational linguistics context-free grammars parallel parsing semantic actions
Unable to display preview. Download preview PDF.
- Aho, A.V., Johnson, S.C., LR Parsing. Computing Surveys 6, 2 (June 1974).Google Scholar
- Aho, A.V., Johnson, S.C., Ullman, J.D., Deterministic Parsing of Ambiguous Grammars. Commun. ACM 18, 8 (Aug. 1975).Google Scholar
- Aho, A.V., Sethi, R., Ullman, J.D. Compilers — Principles, Techniques and Tools. Addison Wesley Publishing Co., Reading, Mass., 1986.Google Scholar
- Blank, G.D. A Finite and Real-Time Processor for Natural Language. Commun. ACM 32, 10 (Oct. 1989).Google Scholar
- Tomita, M. An Efficient Context-Free Parsing Algorithm for Natural Languages and Its Applications. PhD. thesis, Carnegie-Mellon University, 1985.Google Scholar
- Tomita, M. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Norwell, Mass., 1987.Google Scholar
- Winograd, T. Language as a Cognitive Process — Volume 1: Syntax. Addison Wesley Publishing Co., Reading, Mass., 1983.Google Scholar