Introduction and Motivation. Introduction and Motivation. Introduction to Computability. Introduction and Motivation. Theory. Lecture5: Context Free

Transcription

1 ntroduction to Computability Theory Lecture5: Context Free Languages Prof. Amos sraeli 1 ntroduction and Motivation n our study of RL-s we Covered: 1. Motivation and definition of regular languages. 2. DFA-s, NFA-s, RE-s and their equivalence. 3. Non Regular Languages and the Pumping Lemma. 3 ntroduction and Motivation On the last lecture we completed our study of regular languages. (There is still a lot to learn but our time is limited ). 2 ntroduction and Motivation n this lecture, we turn to Context Free Grammars and Context Free Languages. The class of Context Free Languages is an intermediate class between the class of regular languages and the class of Decidable Languages(To be defined). 4

2 ntroduction and Motivation A Context Free Grammar is a machine that creates a language. A language created by a CF grammar is called A Context Free Language. (We will show that) The class of Context Free Languages Properly Contains the class of Regular Languages. 5 Context Free Grammar - Example Consider grammar G 1 : ab ε The grammar generates the language B 1 G 1 { } n n = a b n 0 called the language of, denoted by L. G ( ) G 1 7 Context Free Grammar - Example Consider grammar G 1 : ab ε A CFL consists of substitution s called Productions. The capital letters are the Variables. The other symbols are the Terminals. 6 Context Free Grammar - Example Consider grammar G 1 : ab ε This is a Derivation of the word aaabbb by : ab aabb aaabbb aaabbb G 1 On each step, a single is activated. This mechanism is nondeterministic. 8

3 Context Free Grammar - Example This is A Parse Treeof the word aaabbbb by : G 1 9 a a a ε b b b CF Grammar A Formal Definition A Context Free Grammar is a 4-tupple V,Σ, R, S where: ( ) 1. V is a finite set called the variables. 2. Σ is a finite set, disjoint from Vcalled the terminals. 3. R is a set of s, where a is a variable, and a string of variables and terminals, and 4. S V is the start variable. 11 Context Free Grammar - Example ab ε a a a ε b b b Each internal node of the tree is associated with a single production. 10 A Derivation A Formal Definition A word is a string of terminals. A derivation of a word wfrom a context Free Grammar G = ( V,Σ, R, S ) is a sequence of strings S = s 0 s 2... s l = w, over V Σ, where: 1. s 0 = S is the start variable of G. 2. For each 1 i l, is obtained by s i activating a single production () of Gon one of the variables of. s i 1 12

4 CF Grammar A Formal Definition A word wis in the Language of grammar G, denoted by w L, if there exists a ( G ) derivation whose rightmost string is w. Thus, L ( G ) = { w w can be derived from G } 13 < EXPR 15 Grammar : V = { < EXP, < TERM, < FACTOR } Σ = a b Rules: {,, +,,(,) } < EXPR < EXPR +< TERM < TERM < TERM < TERM < FACTOR < FACTOR < ( EXPR ) a b FACTOR < S =< EXPR 14 < EXPR < EXPR < TERM 16

5 < EXPR < TERM output < EXPR < TERM 17 < EXPR < TERM < TERM < TERM < FACTOR 19 < EXPR < TERM 18 < EXPR < TERM < TERM < FACTOR output < TERM < TERM < FACTOR 20

6 < EXPR < TERM < TERM < FACTOR 21 < EXPR < TERM < TERM < FACTOR < TERM a output < FACTORa 23 < EXPR < TERM < TERM < FACTOR < FACTORa 22 < EXPR < TERM < TERM < FACTOR < TERM a 24

7 < EXPR < TERM < TERM < FACTOR < TERM a < TERM < FACTOR 25 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a 27 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR output < TERM < FACTOR a 26 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a ( < ) < FACTOR EXPR 28

8 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR < EXPR output a ( < ) < FACTOR EXPR 29 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR < EXPR a < EXPR < EXPR +< TERM 31 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR < EXPR a 30 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) output < EXPR < EXPR +< TERM 32

9 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) 33 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a output < EXPR < TERM 35 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) < EXPR < TERM 34 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a 36

10 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a < TERM < FACTOR 37 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a 39 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a output < TERM < FACTOR 38 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a < FACTOR a 40

11 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a ( a +< FACTOR ) a output < FACTOR a 41 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a ( a +< FACTOR ) a < FACTOR b 43 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a ( a +< FACTOR ) a 42 < EXPR < TERM < TERM < FACTOR < TERM a < FACTOR a < EXPR a < EXPR +< TERM ( ) ( < TERM +< TERM ) a ( < FACTOR +< FACTOR ) a ( a +< FACTOR ) a ( a + b) a 44

12 Derivation of a + b a by Grammar : < EXPR < EXPR +< TERM < TERM +< TERM < FACTOR +< TERM a +< TERM a +< TERM < FACTOR a +< FACTOR < FACTOR a + b < FACTOR a + b a Note:There is more than one derivation. 45 Ambiguity We already saw that a word may have more then a single derivation from the same grammar. A Leftmost Derivation is a derivation in which s are applied in order left to right. A grammar is ambiguous if it has Two parse trees. 47 Example3: The Language of WF ( ) To be Demonstrated on the blackboard 46 Ambiguity Reminder:Two parse trees are equal if they are equal as trees and if all productions corresponding to inner nodes are also equal. 48

13 Example4: Similar to Arith. EXPS Grammar : { < EXP, < TERM < } {,, +,,(,) } V =, FACTOR Σ = a b G 4 Rules: < EXPR < EXPR +< EXPR < EXPR < EXPR < EXPR < EXPRa, S =< EXPR, 49 Example4: 2 nd Parse Tree for a + b a < EXPR < EXPR +< EXPR < EXPR < EXPR < EXPR < EXPR < EXPR a + b a 51 Example4: 1 st Parse Tree for a + b a < EXPR < EXPR < EXPR < EXPR < EXPR < EXPR < EXPR < EXPR a + b 50 Ambiguity Note: Some ambiguous grammars may have an unambiguous equivalent grammar. But: There exist nherently Ambiguous Grammars, i.e. an ambiguous grammar that does not have an equivalent unambiguous one. 52 a

14 Discussion Q: From a computational point of view, how strong are context free languages? { } n n A:Since the language B = a b n 0 is not regular and it is CF, we conclude that CFL RL. Q: Can one prove CFL RL? A: Yes. 53 Discussion Q:A language is regular if it is recognized by a DFA (or NFA). Does there exist a type of machine that characterizes CFL? A: Yes, those are the Push-Down Automata (Next Lecture).. Q: Can one prove a language not to be CFL? A:Yes, by the Pumping Lemma for CFL-s. For n n n example: L = a b c n 0 is not CFL. { } 54