Algorithms for Compiler Design (Electrical and Computer Engineering Series)

N

Names

access to nonlocal names, 253-255

address descriptors and, 299

held in symbol tables, 241

runtime name storage, 241

scope of name, 244-246

Non-deterministic finite automata (NFA)

defined and described, 14

DFA equivalents of, 23-27

with ˆˆ -moves, 18-27

equivalence and ˆˆ -moves, 21-22

strings and, 15-16

transformation into deterministic (DFA), 16-18

Nondistinguishable states of DFAs, 27

Nonlocal names, 253-255

Nonterminals in context-free grammar, 54, 56

NOT operator and translation, 215-216