First Sentence:
Figures 2.5 through 2.12 contain the elements of a simple but non-trivial lexical analyzer that recognizes five classes of tokens: identifiers as defined above, integers, one-character tokens, and the token classes ERRONEOUS and EOF.
Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
narrow compiler, simple symbolic interpretation, demo compiler, full symbolic interpretation, iterative interpreter, program data area, prediction stack, backpatch list, conditional text inclusion, input buffer stack, past available memory, sample basic block, chunk pointer, external symbol table, digit seq, repr list, reachable item sets, stack regime, boxing analysis, dynamic cycle detection, handwritten lexical analyzer, initial item set, lexical analysis algorithm, lexical pointer, old symbol table
Key Phrases - Capitalized Phrases (CAPs):
(learn more)
Base Tag, Store Reg, Load Mem, Triple Space, Push Local, Load Reg, Mult Reg, Add Constant, Add Reg, Class of Simple, Declared Idf Sequence, Load Const, Mult Scaled Reg, Subtr Reg, Top of Reduction, Add Mem, Add Scaled Reg, Computer Languages, Insert Label, International Conference, Node Emit, Push Const, Read Mode, Size of Auxiliary, Token Type Token
New!
Concordance
|
Text Stats
Browse Sample Pages:
Front Cover |
Table of Contents |
First Pages |
Index |
Back Cover |
Surprise Me!