Skip to main content
SpringerLink
Log in

Prefix Languages of Church-Rosser Languages

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1974))

Abstract

Church-Rosser languages are mainly based on confluent length reducing string rewriting systems. In general, the prefix language of a Church-Rosser language may not be describable by such a system, too. In this paper it is shown that under certain conditions it is possible to give a construction for a system defining the prefix language and to prove its correctness. The construction also gives a completion of prefixes to full words in the original language. This is an interesting property for practical applications, as it shows potential for error recovery strategies in parsers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. W. Appel. Modern Compiler Implementation in Java. Cambridge Uni-versity Press, 1998.

    Google Scholar 

  2. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.

    Google Scholar 

  3. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141: 1–36, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Dahlhaus and M.K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33: 456–472, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

    Google Scholar 

  6. M. Jantzen. Confluent String Rewriting. Springer-Verlag, 1988.

    Google Scholar 

  7. D. E. Knuth. On the translation of languages from left to right. Information and Control, 8: 607–639, 1965.

    Article  MathSciNet  Google Scholar 

  8. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35: 324–344, 1988.

    MATH  MathSciNet  Google Scholar 

  9. G. Niemann and F. Otto. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, editor, Foundations of Software Sscience and Computation Structures, Proceedings FoSSaCS’98, volume 1378 of LNCS, pages 243–257, Berlin, 1998. Springer-Verlag.

    Chapter  Google Scholar 

  10. F. Otto, M. Katsura, and Y. Kobayashi. Cross-sections for finitely presented monoids with decidable word problems. In H. Comon, editor, Rewriting Techniques and Applications, volume 1232 of LNCS, pages 53–67, Berlin, 1997. Springer-Verlag.

    Google Scholar 

  11. T. Rottschäfer. Eine Entwicklungsumgebung für Church-Rosser Präfixparser. Diplomarbeit, TU-Darmstadt, February 2000.

    Google Scholar 

  12. S. Sippu and E. Soisalon-Soininen. Parsing Theory. VolumeII: LR(k) and LL(k) Parsing. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  13. J. R. Woinowski. A normal form for Church-Rosser language systems. Re-port, TU-Darmstadt, www.iti.tu-darmstadt.de/?woinowsk/, June 2000.

  14. J. R. Woinowski. Prefixes of Church-Rosser languages. Report TI-2/00, TU-Darmstadt, www.iti.tu-darmstadt.de/?woinowsk/, February 2000.

Download references

Author information

Authors and Affiliations

  1. TU Darmstadt, Fachbereich Informatik, Germany

    Jens R. Woinowski

Authors
  1. Jens R. Woinowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Woinowski, J.R. (2000). Prefix Languages of Church-Rosser Languages. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41413-1

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation