Skip to main content
SpringerLink
Log in

Deterministic Techniques for Efficient Non-Deterministic Parsers

  • Conference paper
Automata, Languages and Programming (ICALP 1974)

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

Included in the following conference series:

Abstract

A general study of parallel non-deterministic parsing and translation à la Earley is developped formally, based on non-deterministic pushdown acceptor-transducers. Several results (camplexity and efficiency) are established, same new and other previously proved only in special cases. As an application, we show that for every family of deterministic context-free pushdown parsers (e.g. precedence, LR(k), LL(k), ...) there is a family of general context-free parallel parsers that have the same efficiency in most practical cases (e.g. analysis of programming languages).

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. AHO, A.V., and ULLMAN, J.D., The theory of parsing, translation, and compiling. Prentice-Hall Inc. Englewood Cliffs, N.J., (1972).

    Google Scholar 

  2. BOUCKAERT, M. PIROTTE, A.,and SNELLING, M., Efficient parsing algorithms for general context-free grammars”, Information Sciences (to appear).

    Google Scholar 

  3. BOUCKAERT, M. PIROTTE, A.,and SNELLING, M.,, “SOFT: a tool for writing software”, IEE Conference’ on Software Engineering for Telecommunication Switching Systems, Colchester (1973), Proceedings published by IEE (London).

    Google Scholar 

  4. DERE ER, F.L., Practical translators for LS (k) languages, Ph.D. Thesis, MIT, Cambridge, Mass. (1969).

    Google Scholar 

  5. EARLEY,J. An efficient context-free parsing algorithm, Thesis, Dept. of Computer Science, Carnegie-Mellon University (1968).

    Google Scholar 

  6. IRONS, E.T. “Experiment with an extensible language”, Comm. ACM 13, 1, Jan. 1970, pp. 31–40.

    Article  MATH  Google Scholar 

  7. KASAMI, J. An efficient recognition and syntax analysis algorithm for context-free languages, Report of University of Hawaii, (1965).

    Google Scholar 

  8. LANG, B. “Parallel non-deterministic bottan-up parsing”, Abstract published in the Proceeding of the Int. Symp. on Extensible Languages, Grenoble (1971) SIGPLAN Notices 6–12, December 1971.

    Google Scholar 

  9. VALIANT, L.G. “General context-free recognition in Zess than cubic time”, Report of Carnegie-Mellon University (1974).

    Google Scholar 

  10. YOUNGER, D.H. Recognition and parsing of context-free languages in time n3. Inf. and ControZ, 10 189–208 (1967).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.R.I.A., 78 Rocquencourt, France

    Bernard Lang

Authors
  1. Bernard Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, 66 Saarbrücken/BRD, Deutschland

    Jacques Loeckx

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lang, B. (1974). Deterministic Techniques for Efficient Non-Deterministic Parsers. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21545-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06841-9

  • Online ISBN: 978-3-662-21545-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation