Algorithms for Compiler Design (Electrical and Computer Engineering Series)

S

Scope rules and scope information, 244-246, 253

Search trees for organization of symbol tables, 242-243

Sentential form handles, 136-138

Set difference, set operation, 7

Set operations, defined, 7

Sets

defined, 7

regular sets, 39, 45, 47-51

relations between, 8-9

Shift-reduce conflicts, 169

SLR(1)

exercises, 324

grammars, 152-161

SLR parsing, 151-162, 176-177, 180-190

Source files, LEX, 46-47

Stack allocation

access link set up, 255-257

access to nonlocal names and, 253-255

block statements and, 256-257

call and return sequences, 250-253

Start symbol (S) in context-free grammar, 54

Storage management

heap memory storage, 247-248

procedure activation and activation records, 248-249

stack allocation, 250-257

static allocation, 250

storage allocation, 247-248

Strings, defined, 6

Suffixes, defined, 6

SWITCH statements, translation of, 229-234

Symbol tables

defined and described, 239

exercises, 326

hash tables for organization of, 243-244

implementation of, 239-240

information entry for, 240

linear lists for organization of, 242

names held in, 241

scope information, 244-246

search trees for organization of, 242-243

Syntactic phase error recovery, 260-261

Syntax analysis phase, 2-3

context-free grammar and, 53-54

error recovery during syntactic phase, 260-261

Syntax-directed definitions

L-attributed definitions, 201

translation and, 195-201

Syntax directed translations and translation schemes, 202-203

Syntax trees, 203-204

Synthesized attributes, 197-198

dummy synthesized attributes, 199-201