Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
12Activity

Table Of Contents

1. Control Structures
1.2. IF
1.5. FOR
1.6. SIMD Control Flow
2. Assignments & Expressions
2.1. Simple Assignment
2.2. Assignment Using Expressions
2.3. Expressions As Conditions
2.4. SIMD Expressions
3. Calls
3.2. Parameterized Subroutines
3.3. Parameterized Functions
3.4. Standardized Calling Techniques
1. Chomsky Grammars
Unrestricted Grammars
Context-Sensitive Grammars (CSGs)
Context-Free Grammars (CFGs)
Regular Grammars (RGs)
1.1. What Is a Grammar?
1.2. Type 0: Unrestricted Grammars
1.3. Type 1: Context-Sensitive Grammars
1.4. Type 2: Context-Free Grammars
1.5. Type 3: Regular Grammars
1.5.1. Parsing Using Regular Grammars
1.5.2. Regular Expressions
2. Parsing CFLs
3. Ambiguities
4. Determinism
5. Chomsky Normal and Griebach Normal forms
Griebach Normal Form
6. Backus-Naur Form
7. Syntax Diagrams
7.1. Left Recursive (grouping Left→Right)
7.2. Right Recursive (grouping Right→Left)
7.3. Non-Associative (no grouping)
7.4. Ambiguous
1. Where To Draw The Line
2. Techniques
2.1. Algorithmic (Heuristic)
2.1.1. String Comparisons
2.1.2. Scanning Techniques
2.2. Tabular Recognizers
2.3. Atomic
1. Simple Symbol Tables
1.1. Linear (Stack)
string type value
1.2. Tree
1.3. Hash Table
2. Scoped Symbol Tables
2.1. Linear
2.2. Tree
2.3. Hash Table
1. Parsing Concepts
2. The Parse Problem
3. Bottom-Up Parsers
3.1. Shift/Reduce Parsers
Action Goto
State Core Closure
3.2. Precedence Parsers
4. Top-Down Parsers
4.1. Elimination Of Left Recursion
4.2. Determinism For K=1
5. Backing-Up
6. Error Detection & Recovery
6.1. Sync Symbols
6.2. Subtree Completion
2. Pseudocode Models
2.1. Pascal
2.2. BASIC (on microcomputers)
2.3. Lisp
3. Three-Address Code (tuples)
Result Arg1 Arg2 Operation 3-Address Code
Stack Op. Tuple Generated Stack temp =
4. Parse and Expression Trees
1. Embedded Generators
Token Generate Note Rule & Position
1.1. Implied Information
1.2. Locality of Reference
2. Forward Referencing
2.1. Backpatching
2.2. Multiple-Pass Resolution
3. Template Generators
3.1. Template Formats
3.2. Matching Procedures
4. Interpreters
4.1. Precompilers
4.2. Threaded Interpreters
4.3. Direct Interpreters
1. Constant Folding
Original Optimized
2. Peephole Optimizations
2.1. Redundant Operation Elimination
2.2. Unreachable Instructions
2.3. Jumps To Jumps
2.4. Algebraic Simplification
2.5. Special Instructions
2.6. Reduction In Strength
3. Common Subexpression Elimination
Original Value Numbers Optimized
4. Commutativity
5. Evaluation Methods
6. Library Optimizations
0 of .
Results for:
No results containing your search query
P. 1
compiler notes

compiler notes

Ratings: (0)|Views: 1,105 |Likes:
Published by Nima Seyedtalebi

More info:

Published by: Nima Seyedtalebi on Mar 01, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

01/15/2013

pdf

text

original

You're Reading a Free Preview
Pages 4 to 45 are not shown in this preview.
You're Reading a Free Preview
Pages 49 to 93 are not shown in this preview.
You're Reading a Free Preview
Pages 97 to 98 are not shown in this preview.

Activity (12)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Varsha Sharma liked this
perera.randika liked this
Amit Shah liked this
Madhur Anand liked this
Vinay Gupta liked this
John Kennedy liked this
rajaramansuresh liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->