I found it : https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm#more_climbing https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm#more_clim... It shows the tran

I found it : https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm#more_climbing https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm#more_clim... It shows the transformations that get you from recursive descent to table driven precedence climbing Pratt/TDOP and precedence climbing are actually the same algorithm: https://www.oilshell.org/blog/2016/11/01.html https://www.oilshell.org/blog/2016/11/01.html ...so basically everything can be derived from simple, straightforward predictive recursive descent.