Course Notes on Formal Languages and Compilers

More documents

Recommendations

Info

2 CONTENTS 1. LANGUAGES AND GRAMMARS 6 Strings and sets of strings 6 5 Vocabulary and language 7 Non languages 7 Grammars 7 Derivations and language of a Grammar 8 Classification of Phrase Structure Grammars 8 10 Recognition of Context Sensitive Languages 11 2. CONTEXT FREE GRAMMARS AND LANGUAGES 12 Derivations in Context Free Grammars 12 Ambiguity 13 Recognition of context free languages 13 15 Lemma: Removing rules of the form A 13 Lemma: Removing rules of the form AB 14 Chomsky normal form 15 Theorem: Conversion to Chomsky normal form 15 Derivation In Chomsky Normal Form And Syntax analysis 17 20 Importance of Chomsky Normal Form 17 Forward Deterministic Context Free Grammars 19 Discussion 20 3. REGULAR GRAMMARS AND LANGUAGES 21 Backward Deterministic Regular Grammars 22 25 Recognition Algorithm for Backward Deterministic Regular Grammars 22 Theorem: Conversion to backward deterministic form 22 Some comments on the set construction 23 Theorem: Closure properties of regular languages 24 Pumping Lemma for regular languages 27
3 4. FINITE (STATE) AUTOMATA 28 Equivalence between Finite Automata and Regular Grammars 29 More analogies between finite automata and regular grammars: 30 Extensions of finite automata (Moore and Mealy Machines) 31 5 5. REGULAR EXPRESSIONS 32 Equivalence between regular expressions and regular grammars 32 Theorem: Converting regular expressions to regular grammars 33 Theorem: Converting regular grammars to regular expressions 33 Another Formulation of Regular Languages 35 10 Discussion 36 6. SURVEY OF COMPILER AND INTERPRETER STAGES 37 Lexical Analysis 38 Syntax Analysis 38 Semantic Analysis 39 15 Intermediate Code Generation 40 Code generation (Option 1, in the diagram) 41 Interpretation (Option 2 in the diagram). 41 Optimization 42 Table handling 43 20 Error handling 43 7. SIMPLIFYING THE PROCESS OF BUILDING A COMPILER 44 Notation 44 Bootstrapping a compiler 44 Cross compilation 44 25 8. LEXICAL ANALYSIS 46 9. PROGRAMMING LANGUAGE DESIGN AIMS 49 The definition of programming languages 49
Page 1: 1 5 ב ‏"ה 10 Course</st
Page 5 and 6: 5 14. TRANSLATION TO INTERMEDIATE C
Page 7 and 8: 7 Vocabulary and language 5 10 A vo
Page 9 and 10: 9 Type of Grammar Phrase Structure
Page 11 and 12: 11 3) Write a context sensitive gra
Page 13 and 14: 13 Ambiguity 5 A context free gramm
Page 15 and 16: 15 Exercise: Let G = (N, T, P, S) b
Page 17 and 18: Derivation In Chomsky Normal Form A
Page 19 and 20: 19 Forward Deterministic Context Fr
Page 21 and 22: 21 3. REGULAR GRAMMARS AND LANGUAGE
Page 23 and 24: 23 S' = { U⊆N : U∩S ≠ ∅, th
Page 25 and 26: 25 5 10 15 20 (c) Again, let us arr
Page 27 and 28: 27 5 10 15 5) Let L 1 = {a 2n : n
Page 29 and 30: 29 that is δ(state, input) = new s
Page 31 and 32: 31 3) Similarly any finite automato
Page 33 and 34: Theorem: Converting regular express
Page 35 and 36: 35 The regular expressions for L k
Page 37 and 38: 37 6. SURVEY OF COMPILER AND INTERP
Page 39 and 40: 39 Bottom Up Stack (Top at right) I
Page 41 and 42: 41 Code generation (Option 1, in th
Page 43 and 44: 43 Peephole optimization in assembl
Page 45 and 46: 45 we wish to build L C B B for a n
Page 48 and 49: 48 Note that "#" means "otherwise g
Page 50 and 51: 50 Aids for the compiler writer 5 T
Page 52 and 53:
52 Basic data types and their opera
Page 54 and 55:
54 5 Call by reference is economica
Page 56 and 57:
56 5 So when B executes it can acce
Page 58 and 59:
58 Notes and quest
Page 60 and 61:
60 Example Grammar Used in Descript
Page 62 and 63:
62 different terminals an error is
Page 64 and 65:
64 Exercises: 5 10 15 20 25 30 35 4
Page 69:
69 The parse table is constructed b
Page 72 and 73:
5 id 72 E E ** E E ** E id id 10 Al
Page 74 and 75:
74 1) When t 1 and t 2 have the sam
Page 76 and 77:
76 Exercises: 5 1) For the ambiguou
Page 78 and 79:
78 For example the rules 5 10 C →
Page 80 and 81:
80 Note: When a non terminal is rep
Page 82 and 83:
82 4) Apply the methods of left rec
Page 84 and 85:
84 Constructing FIRST and FOLLOW se
Page 86 and 87:
86 14. TRANSLATION TO INTERMEDIATE
Page 88 and 89:
88 end program; 5 10 15 20 25 30 35
Page 90 and 91:
90 5 10 15 case CS of when name =>
Page 92 and 93:
92 1) The source program is free of
Page 94 and 95:
Structure of translation of express
Page 96:
96 Exercises: 5 10 1) Write a proce
show all

Course Notes on Formal Languages and Compilers

Create successful ePaper yourself

Delete template?

Save as template?