在编译器的前端设计中，对于LL分析和LR分析作为最重要的实现方式。该算法就是书本上的进一步实现Lets fill in the row for State 0 together. Looking back at our notes above, we see that on A we transition to State 1 and on a we transition to State 2. Transitions on terminals like a are called " shift