Homework. Context Free Languages. Before We Start. Announcements. Plan for today. Languages. Any questions? Recall. 1st half. 2nd half.

Size: px

Start display at page:

Download "Homework. Context Free Languages. Before We Start. Announcements. Plan for today. Languages. Any questions? Recall. 1st half. 2nd half."

Philomena Blankenship
5 years ago
Views:

1 Homework Context Free Languages Homework #2 returned Homework #3 due today Homework #4 Pg Exercise 1 (use structural induction) Pg Exercise 3 Pg Exercise 8b,c,d Pg Exercise 22 Pg Exercise 13 Due 10 / 7 Announcements Exam 1 Next class (Oct 2 nd ) 1 hour Cover Regular Languages (up to and including today s lecture) Closed book (1 sheet study guide okay) Before We tart Any questions? Remainder of next class will be a problem session Plan for today 1st half Context Free Grammars and Languages 2nd half Regular Languages and Context Free Languages / L-ystems Languages Recall. What is a language? What is a class of languages? 1

2 Regular Languages For the past several weeks, we have been looking at Regular Languages: language: Regular Expression Machine for accepting: Finite Automata Last class we discovered Venn-diagram of languages Is there something out here? Regular Languages YE! Finite Languages Context Free Languages Context Free Languages(CFL) is the next class of languages outside of Regular Languages: Language / grammar: Context Free Grammar Machine for accepting: Pushdown Automata Grammars Wikipedia says: languages can be described as a system of symbols and the grammars (rules) by which the symbols are manipulated Grammar is the study of rules governing the use of language. Grammars Grammars Let s redefine grammars for C Theory use: 1. Terminals = et of symbols that form the strings of the language being defined 2. Variables = et of symbols representing categories 3. tart ymbol = variable that represents the base category that defines our language 4. Production rules = set of rules that recursively define the language Let s formalize this a bit: A grammar is a 4-tuple: (V, T, P, ) where V is a set of variables T is a set of terminals P is a set of production rules V and T are disjoint (I.e. V T = ) V, is your start symbol 2

3 General Grammars Production Rules Of the form A B A is a string of terminals and variables B is a string of terminals and variables To apply a rule, replace any occurrence of A with the string B. Grammars Let s formalize this a bit: Production rules We say that γ can be derived from α in one step: A β is a rule α = α 1 A α 2 γ = α 1 β α 2 α γ We write α * γ if γ can be derived from α in zero or more steps. Context Free Grammars Production Rules Of the form A B A is a variable B is a string, combining terminals and variables To apply a rule, replace an occurrence of A with the string B. We say that the grammar is context-free since this substitution can take place regardless of where A is. Context Free Grammars The language generated by a grammar Let G = (V, T, P, ) The language generated by G, L(G) L(G) = { x T * * x} A language L is a Context Free Language (CFL) iff there is a CFG G, such that L = L(G) Recall our friend: Palindromes A palindrome is a string that is the same read left to right or right to left First half of a palindrome is a mirror image of the second half s: a, b, aba, abba, babbab. Recursive definition for palindromes (pal) over Σ 1. λ pal 2. For any a Σ, a pal 3. For any x pal and a Σ, axa pal 4. No string is in pal unless it can be obtained by rules 1-3 3

4 A CFG for palindromes over {a,b} Base cases 1. P λ 2. P a 3. P b Recursion 4. P apa 5. P bpb Back to C Theory Building the palindrome abba using grammar P apa (Rule 4) P abpba (Rule 5) P ab λ ba (Rule 1) P abba Another Find a CFG to describe: L = {x {0,1} * n 0 (x) = n 1 (x)} Basic idea (define recursively) λ is certainly in the language For all strings in the language, if we add a 0 and 1 to the string, the result is in the language. The concatenation of any two strings in the language will also be in the language Another Find a CFG to describe: L = {x {0,1} * n 0 (x) = n 1 (x)} λ (1) 01 (2) 10 (3) (4) Another Let s derive a string from L rule rule rule 2 00 λ λ 11 rule 1 = Yet Another example Find a CFG to describe: L = {a i b j c k i = k} Number of a s equals the number of c s with any number of b s between them Use variable B to represent b j Every time you add a to the left of B you need to add c to the right. 4

5 Yet Another example Find a CFG to describe: L = {a i b j c k i = k} B (1) ac (2) B bb (3) B λ (4) Can also write as B ac B bb λ Another example Let s derive a string from L: aabbbcc ac rule 2 aacc rule 2 aabcc rule 1 aabbcc rule 3 aabbbcc rule 3 aabbbbcc rule 3 aabbb λ cc rule 4 = aabbbcc Defining the grammar for algebraic expressions: Let a = a numeric constant et of binary operators = {+, -, *, /} Expressions can be parenthesized Defining the grammar for algebraic expressions: G = (V, T, P, ) V = {} T = { a, -, +, *, /, (, ) } = P = see next slide Defining the grammar for algebraic expressions Production rules + (1) (2) * (3) / (4) () (5) a (6) how derivation for a + (a * a) / a + rule 1 a + a + / rule 4 a + () / rule 5 a + ( * ) / rule 3 a + (a * ) / a + (a * a) / a + (a * a) / a 5

6 Parse Trees Graphical means to illustrate a derivation of a string from a grammar Root of the tree = start variable Interior nodes = other variables Children of nodes = application of a production rule Leaf nodes = Terminal symbols Another example Find a CFG to describe: L = {a i b j c k i = k} B (1) ac (2) B bb (3) B λ (4) Can also write as B ac B bb λ Another example Let s derive a string from L: aabbcc ac rule 2 aacc rule 2 aabcc rule 1 aabbcc rule 3 aabbbcc rule 3 aabb λ cc rule 4 = aabbcc Parse Tree An inorder traversal of the tree will give the the string derived. Rule 2 a c a c Rule 2 B Rule 1 b B Rule 3 b B Rule 3 λ Rule 4 Recall our example from last time Defining the grammar for algebraic expressions Production rules + (1) (2) * (3) / (4) () (5) a (6) how derivation for a + a * a + rule 1 a + a + * rule 3 a + a * a + a * a 6

7 Parse Tree + a * + rule 1 a + a + * rule 3 a + a * a + a * a Another derivation for a + a * a * rule 3 * a + * a rule 1 a + * a a + a * a Parse Tree Parse trees * + a * rule 3 * a + * a rule 1 a + * a a + a * a + a * ame string, 2 derivations * + a Ambiguity A CFG is said to be ambiguous if there is at least 1 string in L(G) having two or more distinct derivations. ome grammars are inherently ambiguous. Ambiguity howing a grammar is ambiguous is easy Find a string x in the L(G) that has two derivations howing a particular grammar is not ambiguous is usually difficult. howing that any grammar is not ambiguous is not possible. 7

8 Derivations Leftmost derivations A leftmost derivation is one where the leftmost variable in the current string is always the first to get replaced vi production rule. A rightmost derivation is one where the rightmost variable in the current string is always the first to get replaced vi production rule. Derivations a + a + a + a + rightmost derivation + + a leftmost derivation Ambiguity Removing ambiguities As it turns out (we won t prove this) In unambiguous grammars,leftmost derivations will always be unique. In unambiguous grammars,rightmost derivations will always be unique. ome languages are inherently ambiguous This cannot always be done In fact, We can/will show there is no algorithm for determining if a CFG is ambiguous However, On a case by case basis, ambiguities can be eliminated Abbreviated grammar for algebraic expressions Production rules + (1) * (2) () (3) a (4) This grammar has two problems 1. Precedence of operators is not respected a * a + a should be interpreted as (a*a) + a 2. equence of identical operators can be grouped either from the left or the right a + a + a can be interpreted as either (a+a)+a or a + (a + a) 8

9 olution Introduce some new variables Factor expression that cannot be broken up by either * or + a () Term expression that cannot be broken up by + All Factors T * F Expression all possible expression All Terms + T Our new grammar + T T T T * F F F () a Note that all recursion is leftmost * has higher precedent than + a + a + a + a * a is interpreted as ((a+a) + a) + (a*a) a + a + a + a * a + T + T T * F + T F F a a F a It can be shown That every string x, that is generated by this new grammar, has only one leftmost derivation As such this new grammar is unambiguous Done using induction on the x. Reality Check Context Free Grammars (CFG) Context Free Languages are generated from CFGs Parse Trees and Derviation Ambiguity About Ambiguity Ambiguity A grammar is ambiguous if there is a string generated by the grammar that has two distinct derivations. ome languages are inherently ambiguous All grammars that generate the language are ambiguous There is no algorithm to determine if any given grammar is ambiguous Proving a grammar to be ambiguous is easy Proving that a grammar is not is hard. 9

10 Questions? Break. 10

Homework. Announcements. Before We Start. Languages. Plan for today. Chomsky Normal Form. Final Exam Dates have been announced

Homework. Announcements. Before We Start. Languages. Plan for today. Chomsky Normal Form. Final Exam Dates have been announced Homework Homework #3 returned Homework #4 due today Homework #5 Pg 169 -- Exercise 4 Pg 183 -- Exercise 4c,e,i Pg 184 -- Exercise 10 Pg 184 -- Exercise 12 Pg 185 -- Exercise 17 Due 10 / 17 Announcements