Algorithms for Compiler Design (Electrical and Computer Engineering Series)

T

Table-driven predictive parsers, implementation, 123-133

Terminals (T) in context-free grammar, 54

Three-address code, 204-205

exercises, 324-325

partitioning into basic blocks, 271-273

Three-address statements, representation of, 205-207, 296

Tokens, lexical analysis and, 5

Top-down parsing

defined and described, 91-92

exercises, 326

implementation, 94-118

predictive top-down parsers, 118-133

Translations and translation schemes

of arithmetic expressions, 208-211

of array references, 225-229

of Boolean expressions, 211-214

of decrement and increment operators, 224-225

examples of, 235-238

exercises, 325

intermediate code generation and, 203-205

of logical expressions, 214-224

procedure calls and, 234-235

specification of, 195-196

of SWITCH / CASE statements, 229-234

syntax-directed definitions, 195-201

Trees. See Parse trees

Triple representation, 206