Editing Top-down parsing language (section)

'''Top-Down Parsing Language''' (TDPL) is a type of [[analytic grammar|analytic]] [[formal grammar]] developed by [[Alexander Birman]] in the early 1970s<ref>{{cite thesis |last1=Birman |first1=Alexander |title=The TMG Recognition Schema |url=https://dl.acm.org/doi/10.5555/905340 |website=ACM Digital Library |publisher=Princeton University |date=1970|type=phd }}</ref><ref>{{cite journal |last1=Birman |first1=Alexander |last2=Ullman |first2=Jeffrey D. |title=Parsing algorithms with backtrack |journal=SWAT '70: Proceedings of the 11th Annual Symposium on Switching and Automata Theory |date=October 1970 |pages=153–174 |doi=10.1109/SWAT.1970.18}}</ref><ref>{{cite journal |last1=Birman |first1=Alexander |last2=Ullman |first2=Jeffrey D. |title=Parsing algorithms with backtrack |journal=Information and Control |date=1973 |volume=23 |issue=1 |pages=1–34 |doi=10.1016/S0019-9958(73)90851-6 |url=https://core.ac.uk/download/pdf/82258594.pdf}}</ref> in order to study formally the behavior of a common class of practical [[top-down parsing|top-down parsers]] that support a limited form of [[backtracking]].  Birman originally named his formalism ''the TMG Schema'' (TS), after [[TMG (language)|TMG]], an early [[parser generator]], but it was later given the name TDPL by [[Alfred V. Aho|Aho]] and [[Jeffrey D. Ullman|Ullman]] in their classic anthology  ''The Theory of Parsing, Translation and Compiling''.<ref>{{cite book |last1=Aho |first1=Alfred V. |last2=Ullman |first2=Jeffrey D. |title=The Theory of Parsing, Translation and Compiling: Volume 1: Parsing |date=1972 |publisher=Prentice-Hall |location=Upper Saddle River, NJ |isbn=978-0-13-914556-8 |pages=456–485 |url=https://dl.acm.org/doi/book/10.5555/578789}}</ref>