Compiler Design

  1. Formal Language Theory
    1. Basic Concepts
      1. Alphabets
        1. Strings
          1. Languages
            1. Operations on Languages
            2. Regular Languages
              1. Regular Expressions
                1. Basic Operators
                  1. Extended Operators
                    1. Regular Definitions
                      1. Algebraic Laws
                      2. Finite Automata
                        1. Deterministic Finite Automata
                          1. Nondeterministic Finite Automata
                            1. Epsilon Transitions
                              1. Equivalence of DFA and NFA
                              2. NFA to DFA Conversion
                                1. Subset Construction Algorithm
                                  1. State Explosion Problem
                                  2. DFA Minimization
                                    1. Equivalent States
                                      1. Partition Refinement Algorithm
                                        1. Minimal DFA Construction
                                        2. Regular Language Properties
                                          1. Closure Properties
                                            1. Decision Problems
                                              1. Pumping Lemma
                                            2. Context-Free Languages
                                              1. Context-Free Grammars
                                                1. Grammar Components
                                                  1. Production Rules
                                                    1. Derivation Process
                                                      1. Language Generation
                                                      2. Derivations and Parse Trees
                                                        1. Leftmost Derivation
                                                          1. Rightmost Derivation
                                                            1. Parse Tree Construction
                                                              1. Derivation Equivalence
                                                              2. Grammar Ambiguity
                                                                1. Ambiguous Grammars
                                                                  1. Inherent Ambiguity
                                                                    1. Disambiguation Techniques
                                                                      1. Precedence and Associativity
                                                                      2. Normal Forms
                                                                        1. Chomsky Normal Form
                                                                          1. Greibach Normal Form
                                                                            1. Transformation Algorithms
                                                                            2. Pushdown Automata
                                                                              1. PDA Components
                                                                                1. Configuration and Transitions
                                                                                  1. Acceptance Conditions
                                                                                    1. Equivalence with CFGs
                                                                                    2. Context-Free Language Properties
                                                                                      1. Closure Properties
                                                                                        1. Pumping Lemma for CFLs
                                                                                          1. Decision Problems