Advertisement

Deterministic techniques for efficient non-deterministic parsers

  • Bernard Lang
Tuesday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

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.

References

  1. [AU]
    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. [BPS1]
    BOUCKAERT, M. PIROTTE, A., and SNELLING, M., Efficient parsing algorithms for general context-free grammars", Information Sciences (to appear).Google Scholar
  3. [BPS2]
    —, "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. [DR]
    DEREMER, F.L., Practical translators for LR (k) languages, Ph.D. Thesis, MIT, Cambridge, Mass. (1969).Google Scholar
  5. [Ea]
    EARLEY, J. An efficient context-free parsing algorithm, Thesis, Dept. of Computer Science, Carnegie-Mellon University (1968).Google Scholar
  6. [Ir]
    IRONS, E.T. "Experiment with an extensible language", Comm. ACM 13, 1, Jan. 1970, pp. 31–40.CrossRefGoogle Scholar
  7. [Ka]
    KASAMI, J. An efficient recognition and syntax analysis algorithm for context-free languages, Report of University of Hawaii, (1965).Google Scholar
  8. [Lg]
    LANG, B. "Parallel non-deterministic bottom-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. [Va]
    VALIANT, L.G. "General context-free recognition in less than cubic time", Report of Carnegie-Mellon University (1974).Google Scholar
  10. [Yo]
    YOUNGER, D.H. Recognition and parsing of context-free languages in time n3. Inf. and Control, 10 189–208 (1967).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

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

Personalised recommendations