Compact non-left-recursive grammars using the selective left-corner transform and factoring

Simple item page
dc.creatorJohnson, Mark
dc.creatorRoark, Brian
dc.date2000-08-22
dc.date.accessioned2026-07-07T03:16:28Z
dc.date.available2026-07-07T03:16:28Z
dc.descriptionThe 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.
dc.description7 pages, 5 tables, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0008021
dc.identifierhttp://arxiv.org/abs/cs/0008021
dc.identifierProceedings of the 18th International Conference on Computational Linguistics (COLING), 2000, pages 355-361
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30369
dc.subjectComputation and Language
dc.subjectI.2.7
dc.titleCompact non-left-recursive grammars using the selective left-corner transform and factoring
dc.typetext

Files

Collections

arXiv