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

@inproceedings{Dymetman1994AST,
  title={A Simple Transformation for Offline-Parsable Grammars and its Termination Properties},
  author={Marc Dymetman},
  booktitle={COLING},
  year={1994}
}
A b s t r a c t We present, in easily reproducible terms, a simple t ransformat ion for offline-parsable grammars which results in a provably te rmina t ing parsing program directly top-down interpretable in Prolog. The t ransformat ion consists in two steps: (1) removal of empty-product ions, followed by: (2) left-recursion el imination. It is related bo th to left-corner parsing (where the g rammar is compiled, ra ther than interpreted through a parsing program, and with the advantage of… CONTINUE READING
1 Citations
11 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Transformations de grammaires logiques et réversibilité en Traduction Automatique

  • Marc Dymetman
  • Thèse d’Etat,
  • 1992
2 Excerpts

A generalization of the offlineparsable grammars

  • Andrew Haas
  • In Proceedings of the 27th Annual Meeting of the…
  • 1989
1 Excerpt

Attribute-Value Logic and the Theory of Grammar. CSLI lecture note No. 16. Center for the Study of Language and Information

  • Mark Johnson
  • 1988
1 Excerpt

Reversible logic grammars for machine translation

  • Marc Dymetman, Pierre Isabelle
  • In Proceedings of the Second International…
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…