Algorithms for Compiler Design (Electrical and Computer Engineering Series)

L

LALR parsing, 165-166, 190-194

Language, defined for lexical analysis, 6

Language tokens, lexical analysis and, 5

L-attributed definitions, 201

Left linear grammar, 86-90

LEX compiler-writing tool, 45-46

action specification in, 46-47

format for input or source files, 46-47

pattern specification in, 46-47

Lexemes, 5

Lexical analysis

design of lexical analyzers, 45-47

phase of compiling, 2-3, 5, 260

Lexical analyzers, design of, 45-47

Lexical phase, 2-3, 5

error recovery, 260

Linear lists for organization of symbol tables, 242

Local common subexpressions , eliminating, 288-290

Logical expressions

AND operator, 214-215

DO-WHILE statements, 220-221

FOR statements, 223-224

IF-THEN-ELSE statements, 216-218

IF-THEN statements, 218-219

NOT operator, 215-216

OR operator, 215

REPEAT statements, 222-223

translation and, 214-224

WHILE statements, 219-220

Loop invariant computations , 271

Loop jamming, 293-294

Loop optimizations, 270-284

back edge identification, 273-274

induction variables , reduction of, 284-288

loop detection, 273

loop jamming, 293-294

loop unrolling, 292-293

reducible flow graphs and, 274-284

Loop unrolling, 292-293

LR parsers and parsing, 140-142, 179-194

LR(1) parsers and parsing

action tables, 163-165

exercises, 324