An Efficient Context-Free Parsing Algorithm with Semantic Actions

As M. Tomita [5] 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.