Top-down parsing language

Top-Down Parsing Language (TDPL) is a type of analytic formal grammar developed by Alexander Birman in the early 1970s[1][2][3] in order to study formally the behavior of a common class of practical top-down parsers that support a limited form of backtracking. Birman originally named his formalism the TMG Schema (TS), after TMG, an early parser generator, but it was later given the name TDPL by Aho and Ullman in their classic anthology The Theory of Parsing, Translation and Compiling.[4]

  1. ^ Birman, Alexander (1970). The TMG Recognition Schema. ACM Digital Library (phd). Princeton University.
  2. ^ Birman, Alexander; Ullman, Jeffrey D. (October 1970). "Parsing algorithms with backtrack". SWAT '70: Proceedings of the 11th Annual Symposium on Switching and Automata Theory: 153–174. doi:10.1109/SWAT.1970.18.
  3. ^ Birman, Alexander; Ullman, Jeffrey D. (1973). "Parsing algorithms with backtrack" (PDF). Information and Control. 23 (1): 1–34. doi:10.1016/S0019-9958(73)90851-6.
  4. ^ Aho, Alfred V.; Ullman, Jeffrey D. (1972). The Theory of Parsing, Translation and Compiling: Volume 1: Parsing. Upper Saddle River, NJ: Prentice-Hall. pp. 456–485. ISBN 978-0-13-914556-8.