Deterministic techniques for efficient non-deterministic parsers

  • Bernard Lang
Tuesday Afternoon

DOI: 10.1007/3-540-06841-4_65

Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)
Cite this paper as:
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

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 (complexity and efficiency) are established, some 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).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • Bernard Lang
    • 1
  1. 1.I.R.I.A. 78 RocquencourtFrance

Personalised recommendations