Compact non-left-recursive grammars using the selective left-corner transform and factoring
<|reference_start|>Compact non-left-recursive grammars using the selective left-corner transform and factoring: 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.<|reference_end|>
@article{johnson2000compact,
    title={Compact non-left-recursive grammars using the selective left-corner
  transform and factoring},
    author={Mark Johnson and Brian Roark},
    journal={Proceedings of the 18th International Conference on Computational
  Linguistics (COLING), 2000, pages 355-361},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0008021},
    primaryClass={cs.CL}
}