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

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

2000-08-22

arxiv.org/abs/cs/0008021v1

Proceedings of the 18th International Conference on Computational Linguistics (COLING), 2000, pages 355-361

Computer Science

Computation and Language

7 pages, 5 tables, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compact non-left-recursive grammars using the selective left-corner transform and factoring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compact non-left-recursive grammars using the selective left-corner transform and factoring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact non-left-recursive grammars using the selective left-corner transform and factoring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134037