Последовательность грамматического разбора LL(1)
L (1) L -> E >
E Q (2)
E -> T F dir = +
T F Q (6) T -> x
a F Q (4) F -> + E
a + E Q (2) E -> T F dir = *
a + T F Q (6) T -> x
a + b F Q (5) F -> * T
a + b * T Q (7) T -> ( E P
a + b * ( E P Q (2) E -> T F dir = +
a + b * ( T F P Q (6) T -> x
a + b * ( c F P Q (4) F -> + E
a + b * ( c + E P Q (2) E -> T F dir = *
a + b * ( c + T F P Q (6) T -> x
a + b * ( c + d F P Q (5) F -> * T
a + b * ( c + d * T P Q (6) T -> x
a + b * ( c + d * e P Q (8) P -> )
a + b * ( c + d * e ) Q (9) Q-> >
a + b * ( c + d * e ) >
a | + b*(c+d*e)>
a | + b*(c+d*e)>
+ | b *(c+d*e)>
b | * (c+d*e)>
b | * (c+d*e)>
* | ( c+d*e)>
( | c +d*e)>
c | + d*e)>
c | + d*e)>
+ | d *e)>
d | * e)>
d | * e)>
* | e )>
e | ) >
) | >
> |
beg (L -> E >) = {x, ( }
beg (E -> T F) = { x, ( } dir (E -> T F) = { +, * }
beg (E -> T) = {x , ( } dir (E -> T) = { ), > }
beg (F -> + E) = { + }
beg (F -> * T) = { * }
beg (T -> x) = { x }
beg (T -> ( E P} = { ( }
beg (P -> ) ) = { ) }