For example, assume a language consisting of the terminal symbols 'n', '+', '(', ')', the nonterminals 'E', 'T', the starting rule 'S' and the following production rules: S → E E → T E → ( E ) T → n T → + T T → T + n Items sets will be generated by analog to the procedure for LR(0) parsers. The item set 0 which represents the initial state will be created from the starting rule: [S → • E, $] The dot '•' denotes the marker of the current parsing position within this rule. The expected lookahead terminal to apply this rule is noted after the comma. The '$' sign is used to denote 'end of input' is expected, as is the case for the starting rule.
For example, assume a lang,uage consisting of the terminal symbols 'n', '+', '(', ')', the nonterminals 'E', 'T', the starting rule 'S' and the following production rules: S → E E → T E → ( E ) T → n T → + T T → T + n Items sets will be generated by analog to the procedure for LR(0) parsers. The item set 0 which represe.nts the initial state will be created from the starting rule: [S → • E, $] The dot '•' denotes the marker of the current parsing position within this rule. The expected lookahead terminal to apply this rule is noted after the comma The '$' sign is used! to denote 'end of input' is expected, as is the case for the startin:g rule.