In compiler formal language theory, what is a 'Sentential Form'?
If S =>* $\alpha$, where \alpha contains terminals and/or non-terminals, then \alpha is a sentential form of the grammar.
What is defined as a 'Sentence' of a grammar in compiler theory?
A sentence is a special sentential form that contains zero non-terminals (only terminals). The language L(G) is the set of all sentences.
Which fundamental functions are required to compute the canonical collection of LR item sets?
CLOSURE() and GOTO() build state item sets, while FIRST() and FOLLOW() are used for lookahead computation in SLR and LR items.
In an LR(0) item of the form A -> $\alpha$. \beta, what does the dot (.) signify?
The dot '.' indicates that \alpha has been parsed and is currently on stack, while \beta is expected to be seen in the remaining input.
An LR item of the form A -> $\alpha$. (where the dot is at the extreme right end of the production) is called a:
When the dot is at the extreme right, the full RHS \alpha has been seen, signaling a candidate Reduction by rule A -> $\alpha$.