Algorithms for Compiler Design (Electrical and Computer Engineering Series)

R

Recursion, eliminating left recursion, 75-77

Recursive descent parsers, implementation, 94-118

Reduce-reduce conflicts, 170-171

Reducible flow graphs

and code optimization, 274-284

loop invariant statements and, 282-283

Reduction of grammar, 61-70

algorithm for identifying useless symbols, 64

bottom-up parsing and, 135-136

Registers

algebraic properties to reduce requirements for, 317-318

register descriptors, 299

RSTACK to allocate, 309-313

selecting for computation, 297

Regular expression notation

finite automata definitions, 6-8

role in lexical analysis, 5

Regular expressions

defined and described, 39-43

exercise, 323

lexical analyzer design and, 45

obtained from finite automata, 43-44

obtained from regular grammar, 84-85

operators for, 40 see also Regular expression notation

Regular grammar, 77-85

defined, 77

ˆˆ - productions and, 77

regular expressions from, 84-85

Regular sets, 39

exercises, 326

lexical analyzer design and, 45

properties of, 47-51

Relations

defined and described, 8

properties of, 8-9

property closure of, 9

symbol for in CFG, 54

REPEAT statements and translation, 222-223

Return sequences, stack allocation and, 250-253

Right linear grammar, 85-86

RSTACKs, allocating registers with, 309-313