Algorithms for Compiler Design (Electrical and Computer Engineering Series)

E

ˆˆ -closure(q), finding, 19-20

ˆˆ -moves

acceptance of strings by NFAs with, 19

equivalence of NFAs with and without, 21-22

finding ˆˆ -closure(q), 19-20

NFAs with, 18-27

ˆˆ - productions

defined, 70

eliminating, 71-73

and nonnullable nonterminals , 70-71

regular grammar and, 77-84

ˆˆ -transitions, 18

Equivalence of automata , 51-52

Error handling

detection and report of errors, 259-260

exercises, 325

lexical phase errors, 260

in LR parsing, 261-264

panic mode recovery, 261

phase level recovery, 261-264

predictive parsing error recovery, 264-267

semantic errors and, 268

YACC and, 264

Errors. See Error handling