This post explores parsing algorithms such as LL and LR. It explains the concepts of LR(0) and LALR(1), and introduces the idea of recursive ascent parsing as the LR analogue to recursive descent parsing. The post also touches on automata, parsetable construction, and the expressive power of different parsing techniques.
Table of contents
Push-Down AutomataContext-Free Grammars, Derivations, and a naive PDA translationDerivations, Parse Trees and AmbiguityPredictive ParsingRecursive DescentSummary of LL, and an insight from the automatonExpressive power and relation to LLHow LR worksLR parsetable construction and expressivityRecursive AscentRecursive Ascent-Descent ParsingSort: