Department of Computer ScienceUniversity of Calgary
Cite this article as:
Aycock, J. & Borsotti, A. Acta Informatica (2009) 46: 549. doi:10.1007/s00236-009-0107-6
Traditional Earley parsers operate in two phases: first recognizing the input, then constructing the forest of parse trees. Practically speaking, this quirk makes it awkward to use in a compiler-compiler, because semantic actions attached to rules are only executed after the fact. We address this problem by identifying safe Earley sets, points during the recognition phase at which partial parse trees can be constructed; this means that semantic actions may be executed on the fly. A secondary benefit is that Earley sets can be deleted during recognition, resulting in a substantial savings of both space and time.