Deterministic techniques for efficient non-deterministic parsers
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).
Unable to display preview. Download preview PDF.
- [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
- [BPS1]BOUCKAERT, M. PIROTTE, A., and SNELLING, M., Efficient parsing algorithms for general context-free grammars", Information Sciences (to appear).Google Scholar
- [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
- [DR]DEREMER, F.L., Practical translators for LR (k) languages, Ph.D. Thesis, MIT, Cambridge, Mass. (1969).Google Scholar
- [Ea]EARLEY, J. An efficient context-free parsing algorithm, Thesis, Dept. of Computer Science, Carnegie-Mellon University (1968).Google Scholar
- [Ka]KASAMI, J. An efficient recognition and syntax analysis algorithm for context-free languages, Report of University of Hawaii, (1965).Google Scholar
- [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
- [Va]VALIANT, L.G. "General context-free recognition in less than cubic time", Report of Carnegie-Mellon University (1974).Google Scholar