New answers tagged syntax
0
votes
Accepted
find LR(1) items of the first state
$S\to.E$,\$.........$(1)$, now compute the closure of $E$, which is $E\to.E+T,$\$..........$(2)$ and $E\to.T,$\$.........$(3)$ use lookahead \$ because in $(1)$ after $E$ is \$ and $FIRST$ of \$ is \$ ...
Top 50 recent answers are included
Related Tags
syntax × 46programming-languages × 19
formal-grammars × 10
compilers × 9
semantics × 9
context-free × 6
parsers × 6
syntax-trees × 6
formal-languages × 4
type-theory × 4
algorithms × 3
automata × 3
terminology × 3
lambda-calculus × 3
language-design × 3
python × 2
history × 2
ambiguity × 2
c × 2
turing-machines × 1
computability × 1
finite-automata × 1
reference-request × 1
trees × 1
regular-expressions × 1