编译原理可视化 2021-12-08

递归下降分析

https://maeyler.github.io/Automata-2018/cfg/Bilal_RecursiveDescentParser.html#form

例子：

32-36*3

LR(1)

http://jsmachines.sourceforge.net/machines/lr1.html

例子：

S -> E
E -> ( L , E )
E -> F
L -> L , E
L -> E
F -> ( F )
F -> d

( d , d , d )

LL(1)

https://www.cs.princeton.edu/courses/archive/spring20/cos320/LL1/

LR(0)

https://www.cs.princeton.edu/courses/archive/spring20/cos320/LR0/