Formal Languages and Automata: Simplification of Context-Free Grammars and Normal Forms

Formal Languages and Automata
Chapter 6 Simplication of Context-Free Grammars and Normal Forms

Chuan-Ming Liu
[email protected]
Department of Computer Science and Information Engineering National Taipei University of Technology Taipei, TAIWAN
Mobile Computing and Software Engineering p. 1/3
Objectives
Study several transformations and substitutions Investigate normal forms for context-free grammars (cfgs) Chomsky normal form Greibach normal form Discuss useless, , and unit- productions
Contents
Methods for Transforming Grammars Two Important Normal Forms A Membership Algorithm for cfgs .
Methods for Transforming Gramma

The empty string plays a rather singular role in many theorems and proofs. We restrict our discussion to -free languages.
A Useful Substitution Rule

Theorem: Let G = (V, T, S, P ) be a context-free grammar (cfg). Suppose that P contains a production of the form A x1 Bx2 . Assume that A and B are different variables and that B y1 |y2 | |yn is the set of all productions in P which have B as the left side. = (V, T, S, P ) be the grammar in which P is Let G constructed by deleting A x1 Bx2 from P , and adding to it A x1 y1 x2 |x1 y2 x2 | |x1 yn x2 . ) = L(G). Then, L(G
Example 1
Consider G = ({A, B }, {a, b, c}, A, P ) with A a|aaA|abBc, B abbA|b as described in the above theorem? What is G Note: 1. The substitution rule we discussed here needs that A and B are distinct. How about A = B ? 2. Consider the productions associated with B after the substitution.
Removing Useless Productions

Denition: (Useful Variable) Let G = (V, T, S, P ) be a context-free grammar (cfg). A variable A is said to be useful if and only if there exists at least one w L(G) such that S = xAy = w, with x, y (V T ) . Denition: (Useless Variable) A variable is not useful is called useless. A production is useless if it involves any useless variable.
Example 2
Consider G = ({A, B, S }, {a, b}, S, P ) with S A, A aA|, B bA B is useless and B bA is a useless production. Note: Two reasons why a variable is useless 1. it can not be reached from the start symbol. 2. it can not derive a terminal string.
Example 3
Eliminate useless variables and productions from G = ({A, B, C, S }, {a, b}, S, P ) with P consisting of S A B C Solution: aS |A|C, a, aa, aCb.
Rule 1
Theorem: Let G = (V, T, S, P ) be a context-free grammar. Then there exists an equivalent grammar = (V ,T , S, P ) that does not contain any useless G variables or productions.
Removing -Productions
Denition: (-production) Any production of a cfg of the form A is call a -production. Denition: (Nullable Variable) Any variable A for which the derivation A = is possible is called nullable.
Example 4
Consider the grammar S aS1 b, S1 aS1 b|, which generates the -free language {an bn : n 1}. S1 can be removed by adding S ab, S1 ab.
Rule 2
Theorem: Let G = (V, T, S, P ) be a context-free grammar with L(G). Then there exists an equivalent grammar = (V ,T , S, P ) that does not contain any G -productions.
Example 5
Find a cfg without -productions equivalent to the grammar dened by S A B C D ABaC, BC, b|, D|, d.
Removing Unit-Productions
Denition: (Unit-Productions) Any production of a cfg of the form AB where A, B V , is call a unit-production.
Rule 3
Theorem: Let G = (V, T, S, P ) be a context-free grammar without -productions. Then there exists an = (V ,T , S, P ) that does not contain equivalent cfg G any unit-productions.
Example 6
Remove all unit-productions from S Aa|B, B A|bb, A a|bc|B.
Theorem
Let L be a context free language that does not contain . Then there exists a cfg that generates L and that does not have any useless productions, -productions, or unit-productions.
Contents
Methods for Transforming Grammars Two Important Normal Forms A Membership Algorithm for cfgs .
Chomsky Normal Form

Note: the string on the right of a production consist of no more than two symbols. Denition: A cfg is in Chomsky normal formChomsky normal form if all productions are of the form A BC or A a, where A, B, C V and a T .
Example 7
The grammar S AS |a, A SA|b is in Chmosky normal form. The grammar S AS |AAS, A SA|aa is not in Chmosky normal form.
Theorem
Any cfg G = (V, T, S, P ) with L(G) has an = (V ,T , S, P ) in Chomsky equivalent grammar G normal form.
Example 8
Convert the grammar with productions S abA, A aab, B Ac to Chmosky normal form.
Greibach Normal Form

Note: We put restrictions on the positions in which terminals and variables can appear. Denition: A cfg is in Chomsky normal form if all productions are of the form A ax, where x V and a T . Note: the form A ax is common to both Greibach normal form and s-grammar, but Greibach normal form does not put the restriction that the pair (A, a) occur at most once.
Example 9
The grammar S AB, A aA|bB |b, B b is not in Greibach normal form.
Example 10
Convert the grammar S abSb|aa to Greibach normal form.
Theorem
Any cfg G = (V, T, S, P ) with L(G) has an = (V ,T , S, P ) in Greibach equivalent grammar G normal form.
Contents
Methods for Transforming Grammars Two important Normal Forms A Membership Algorithm for cfgs .
CYK Algorithm
An algorithm to verify if a given string belongs to the language generated by some given cfg. According to the dynamic programming algorithmic design paradigm. The given cfg G = (V, T, S, P ) is in Chomsky normal form. Given a string w = a1 a2 an , we dene substrings wij = ai aj , and subsets Vij = {A V : A wij } V . Clearly, w L(G) S V1n .
Computing Vij
Consider two forms dened in Chomsky normal form: For each i, A Vii A ai ; For j > i, A wij a production A BC , with B wik , C wk+1j , for some i k < j . In other words,
Vij =
k{i,i+1,...,j 1}
{A : A BC, with B Vik , C Vk+1j }
Bottom-up Approach
Use a Bottom-up approach to compute all Vij with the equations discussed Compute V11 , V22 , . . . , Vnn , Compute V12 , V23 , . . . , Vn1,n , Compute V13 , V24 , . . . , Vn2,n ,
Algorithm - Pseudocode
M EMBERSHIP (G, w ) 1 for i 1 to n n = |w|; 2 do if A ai exists 3 then Vii = A 4 else Vii = 5 for l 2 to n 6 do for i 1 to n l + 1 7 do j i + l 1 8 for k i to j 1 9 do if A BC exists 10 for B Vik and C Vk+1,j 11 then Vij = Vij {A} 12 if S V1n 13 then w L(G)
Example 11
Determine whether the string w = aabbb is in the language generated by the grammar S AB, A BB |a, B AB |b.

Formal Languages and Automata: Simplification of Context-Free Grammars and Normal Forms

Uploaded by

Copyright:

Available Formats

Formal Languages and Automata: Simplification of Context-Free Grammars and Normal Forms

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Formal Languages and Automata: Simplification of Context-Free Grammars and Normal Forms

Uploaded by

Copyright:

Available Formats

Formal Languages and Automata

Chapter 6 Simplication of Context-Free Grammars and Normal Forms

Mobile Computing and Software Engineering p. 1/3

Mobile Computing and Software Engineering p. 2/3

Mobile Computing and Software Engineering p. 3/3

Methods for Transforming Gramma

Mobile Computing and Software Engineering p. 4/3

A Useful Substitution Rule

Mobile Computing and Software Engineering p. 5/3

Mobile Computing and Software Engineering p. 6/3

Removing Useless Productions

Mobile Computing and Software Engineering p. 7/3

Mobile Computing and Software Engineering p. 8/3

Mobile Computing and Software Engineering p. 9/3

Mobile Computing and Software Engineering p. 10/3

Mobile Computing and Software Engineering p. 11/3

Mobile Computing and Software Engineering p. 12/3

Mobile Computing and Software Engineering p. 13/3

Mobile Computing and Software Engineering p. 14/3

Mobile Computing and Software Engineering p. 15/3

Mobile Computing and Software Engineering p. 16/3

Mobile Computing and Software Engineering p. 17/3

Mobile Computing and Software Engineering p. 18/3

Mobile Computing and Software Engineering p. 19/3

Chomsky Normal Form

Mobile Computing and Software Engineering p. 20/3

Mobile Computing and Software Engineering p. 21/3

Mobile Computing and Software Engineering p. 22/3

Mobile Computing and Software Engineering p. 23/3

Greibach Normal Form

Mobile Computing and Software Engineering p. 24/3

Mobile Computing and Software Engineering p. 25/3

Mobile Computing and Software Engineering p. 26/3

Mobile Computing and Software Engineering p. 27/3

Mobile Computing and Software Engineering p. 28/3

Mobile Computing and Software Engineering p. 29/3

{A : A BC, with B Vik , C Vk+1j }

Mobile Computing and Software Engineering p. 30/3

Mobile Computing and Software Engineering p. 31/3

Mobile Computing and Software Engineering p. 32/3

Mobile Computing and Software Engineering p. 33/3

You might also like