A Simple Transformation for Offline-Parsable Grammars and its Termination Properties

Details A Simple Transformation for Offline-Parsable Grammars and its Termination Properties A Simple Transformation for Offline-Parsable Grammars and its Termination Properties

1996-05-14

arxiv.org/abs/cmp-lg/9605023v1

Computer Science

Computation and Language

Latex. 5 pages. Appeared in Coling-94 Proceedings

Scientific paper

We present, in easily reproducible terms, a simple transformation for offline-parsable grammars which results in a provably terminating parsing program directly top-down interpretable in Prolog. The transformation consists in two steps: (1) removal of empty-productions, followed by: (2) left-recursion elimination. It is related both to left-corner parsing (where the grammar is compiled, rather than interpreted through a parsing program, and with the advantage of guaranteed termination in the presence of empty productions) and to the Generalized Greibach Normal Form for DCGs (with the advantage of implementation simplicity).

Affiliated with

Also associated with

No associations

Rating

A Simple Transformation for Offline-Parsable Grammars and its Termination Properties 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 A Simple Transformation for Offline-Parsable Grammars and its Termination Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Transformation for Offline-Parsable Grammars and its Termination Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313877