Compact non-left-recursive grammars using the selective left-corner transform and factoring
Computation and Language
2007-05-23 v1
Abstract
The left-corner transform removes left-recursion from (probabilistic) context-free grammars and unification grammars, permitting simple top-down parsing techniques to be used. Unfortunately the grammars produced by the standard left-corner transform are usually much larger than the original. The selective left-corner transform described in this paper produces a transformed grammar which simulates left-corner recognition of a user-specified set of the original productions, and top-down recognition of the others. Combined with two factorizations, it produces non-left-recursive grammars that are not much larger than the original.
Cite
@article{arxiv.cs/0008021,
title = {Compact non-left-recursive grammars using the selective left-corner transform and factoring},
author = {Mark Johnson and Brian Roark},
journal= {arXiv preprint arXiv:cs/0008021},
year = {2007}
}
Comments
7 pages, 5 tables, 2 figures