Algorithms for Compiler Design (Electrical and Computer Engineering Series)

ISBN: 1584501006
EAN: 2147483647

Year: 2005
Pages: 108

Authors: O G Kakde

BUY ON AMAZON

BackCover
Algorithms for Compiler Design
Preface
Chapter 1: Introduction
1.2 WHAT IS A CROSS-COMPILER?
1.3 COMPILATION
1.4 REGULAR EXPRESSION NOTATIONFINITE AUTOMATA DEFINITIONS
1.5 RELATIONS
Chapter 2: Finite Automata and Regular Expressions
2.2 NON-DETERMINISTIC FINITE AUTOMATA
2.3 TRANSFORMING NFA TO DFA
2.4 THE NFA WITH -MOVES
2.5 THE NFA WITH -MOVES TO THE DFA
2.6 MINIMIZATIONOPTIMIZATION OF A DFA
2.7 EXAMPLES OF FINITE AUTOMATA CONSTRUCTION
2.8 REGULAR SETS AND REGULAR EXPRESSIONS
2.9 OBTAINING THE REGULAR EXPRESSION FROM THE FINITE AUTOMATA
2.10 LEXICAL ANALYZER DESIGN
2.11 PROPERTIES OF REGULAR SETS
2.12 EQUIVALENCE OF TWO AUTOMATAS
Chapter 3: Context-Free Grammar and Syntax Analysis
3.2 CONTEXT-FREE GRAMMAR
3.3 REGULAR GRAMMAR
3.4 RIGHT LINEAR AND LEFT LINEAR GRAMMAR
Chapter 4: Top-Down Parsing
4.1 TOP-DOWN PARSING
4.2 IMPLEMENTATION
4.3 THE PREDICTIVE TOP-DOWN PARSER
Chapter 5: Bottom-up Parsing
5.2 A HANDLE OF A RIGHT SENTENTIAL FORM
5.3 IMPLEMENTATION
5.4 THE LR PARSER
5.5 DATA STRUCTURES FOR REPRESENTING PARSING TABLES
5.6 WHY LR PARSING IS ATTRACTIVE
5.7 EXAMPLES
Chapter 6: Syntax-Directed Definitions and Translations
6.2 IMPLEMENTATION OF THE TRANSLATIONS SPECIFIED BY SYNTAX-DIRECTED DEFINITIONS
6.3 L-ATTRIBUTED DEFINITIONS
6.4 SYNTAX-DIRECTED TRANSLATION SCHEMES
6.5 INTERMEDIATE CODE GENERATION
6.6 REPRESENTING THREE-ADDRESS STATEMENTS
6.7 SYNTAX-DIRECTED TRANSLATION SCHEMES TO SPECIFY THE TRANSLATION OF VARIOUS PROGRAMMING LANGUAGE CONSTRUCTS
6.8 IMPLEMENTATION OF INCREMENT AND DECREMENT OPERATORS
6.9 THE ARRAY REFERENCE
6.10 SWITCHCASE
6.11 THE PROCEDURE CALL
6.12 EXAMPLES
Chapter 7: Symbol Table Management
7.2 IMPLEMENTATION
7.3 ENTERING INFORMATION INTO THE SYMBOL TABLE
7.4 WHERE SHOULD NAMES BE HELD?
7.5 INFORMATION ABOUT THE RUNTIME STORAGE LOCATION
7.6 VARIOUS APPROACHES TO SYMBOL TABLE ORGANIZATION
7.7 REPRESENTING THE SCOPE INFORMATION IN THE SYMBOL TABLE
Chapter 8: Storage Management
8.2 ACTIVATION OF THE PROCEDURE AND THE ACTIVATION RECORD
8.3 STATIC ALLOCATION
8.4 STACK ALLOCATION
Chapter 9: Error Handling
9.2 RECOVERY FROM LEXICAL PHASE ERRORS
9.3 RECOVERY FROM SYNTACTIC PHASE ERRORS
9.4 ERROR RECOVERY IN LR PARSING
9.5 AUTOMATIC ERROR RECOVERY IN YACC
9.6 PREDICTIVE PARSING ERROR RECOVERY
9.7 RECOVERY FROM SEMANTIC ERRORS
Chapter 10: Code Optimization
10.2 WHAT IS CODE OPTIMIZATION?
10.3 LOOP OPTIMIZATION
10.4 ELIMINATING INDUCTION VARIABLES
10.5 ELIMINATING LOCAL COMMON SUBEXPRESSIONS
10.6 ELIMINATING GLOBAL COMMON SUBEXPRESSIONS
10.7 LOOP UNROLLING
10.8 LOOP JAMMING
Chapter 11: Code Generation
11.2 PROBLEMS THAT HINDER GOOD CODE GENERATION
11.3 THE MACHINE MODEL
11.4 STRAIGHTFORWARD CODE GENERATION
11.5 USING DAG FOR CODE GENERATION
11.6 USING ALGEBRAIC PROPERTIES TO REDUCE THE REGISTER REQUIREMENT
11.7 PEEPHOLE OPTIMIZATION
Chapter 12: Exercises
Index
Index_B
Index_C
Index_D
Index_E
Index_F
Index_G
Index_H
Index_I
Index_J-K
Index_L
Index_M
Index_N
Index_O
Index_P
Index_Q
Index_R
Index_S
Index_T
Index_U
Index_V
Index_W-X
Index_Y-Z
List of Figures
List of Tables
List of Examples
Page #108 (List of Tables)