Scribd
Upload
43 views20 pages

Grammar: Beulah A. Ap/Cse

The document discusses formal languages and grammars. It defines a formal grammar as consisting of a finite set of nonterminal symbols, a finite set of terminal symbols, a finite set of production rules where the left side contains at least one nonterminal, and a designated start symbol. Grammars are used to define valid sentences and provide structural descriptions of sentences. Derivations start with the start symbol and replace nonterminals with terminal strings using the productions until all terminals are obtained. The language generated by a grammar is the set of all terminal strings derived from the start symbol.

Uploaded by

Sruthisree R M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views20 pages

Grammar: Beulah A. Ap/Cse

The document discusses formal languages and grammars. It defines a formal grammar as consisting of a finite set of nonterminal symbols, a finite set of terminal symbols, a finite set of production rules where the left side contains at least one nonterminal, and a designated start symbol. Grammars are used to define valid sentences and provide structural descriptions of sentences. Derivations start with the start symbol and replace nonterminals with terminal strings using the productions until all terminals are obtained. The language generated by a grammar is the set of all terminal strings derived from the start symbol.

Uploaded by

Sruthisree R M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

GRAMMAR

Beulah A.
AP/CSE
Example
2

• The theory of formal languages is used in the field of


Linguistics- to define valid sentences and give structural
descriptions of sentences.
S→<noun> <verb> <adverb>
S→<noun><verb>
<noun>→ Andrew
<noun> → Joe
<verb>→ ran
<verb> → ate
<adverb> → slowly
<adverb> → quickly
Beulah A. July 26, 2018
Example
3

 S variable to denote a sentence


 → represents a rule meaning that the word on the right
side of the arrow can replace the word on the left side of
the arrow.
 P collection of rules (or) productions.
 The sentences are derived from the above mentioned
productions by:
 Starting with S
 Replacing words using the productions

 Terminating when a string of terminals is obtained.


Beulah A. July 26, 2018
Example
4

 S→<noun><verb><adverb>
 S → Joe ate slowly

 S → <noun><verb>
 S → Andrew ran

Beulah A. July 26, 2018


Backus-Naur Form
5

 Backus-Naur Form or Backus Normal Form  BNF


 BNF is formal and precise
 BNF is a notation for context-free grammars
 BNF is essential in compiler construction
 Example
<number> ::= <digit> | <number> <digit>
<digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

Beulah A. July 26, 2018


Formal Grammar - Definition
6

A formal grammar G = (N, Σ, P, S) consists of:


 A finite set N of non terminal symbols.

 A finite set Σ of terminal symbols that is disjoint from N.

 A finite set P of production rules where a rule is of the


form
 string in (Σ U N)* → string in (Σ U N)*
 the left-hand side of a rule must contain at least one non
terminal symbol.
 A symbol S in N that is indicated as the start symbol.
Beulah A. July 26, 2018
Example
7

 G = (N, Σ, P, S)
 N = {<sentence>,<noun>,<verb>,<adverb>}
 Σ = {Andrew, Joe, ate, ran ,slowly, quickly}
 S = <sentence>
 P

Beulah A. July 26, 2018


Example
8

The grammar G with N = {S, B}, Σ = {a, b, c}, P


consisting of the following productions
 S → aBSc
 S → abc
 Ba → aB
 Bb → bb

Beulah A. July 26, 2018


Notations
9

Names Beginning with Represent Examples


Symbols In
Uppercase N A, B, C, Prefix

Lowercase and  a, b, c, if, then, (, ;


punctuation
X, Y N Xi, Y3

Other Greek letters (N)* , , 

Beulah A. July 26, 2018


Different Types of Grammar
10

http://www.tutorialspoint.com/automata_theory/cho
msky_classification_of_grammars.htm

Beulah A. July 26, 2018


Derivation
11

 If α→β is a production in a grammar G and γ, δ are


any two strings on N∪Σ, then we say γαδ directly
derives γβδ in G.
 (i.e.) γαδ ⇒γβδ
 This process is called one-step derivation.
 In particular, if α→β is a production, then α G⇒β

Beulah A. July 26, 2018


Derivation
12

 The purpose of a grammar is to derive strings in the


language defined by the grammar
   ,  can be derived from  in one step
 + derived in one or more steps
 * derived in any number of steps
 lm leftmost derivation
 Always substitute the leftmost non-terminal
 rm rightmost derivation
 Always substitute the rightmost non-terminal
Beulah A. July 26, 2018
Example
13

 G = ({S}, {0,1}, {S→0S1, S→01}, S) then the


derivation is:
 S ⇒ 0S1
⇒ 0011
is a one step derivation, where S is replaced by 01.

Beulah A. July 26, 2018


Example
14

S  AB
Bb
A  aA | c
 Derivation
S  AB
 aAB
 aAb
 aaAb
 aacb

Beulah A. July 26, 2018


Language
15

 The language generated by a grammar G, L(G) is


defined as {w ∈ Σ* | S⇒* w}.
 The elements of L(G) are called sentences.
 Stated in simple way, L(G) is the set of all terminal
strings derived from the start symbol S.

Beulah A. July 26, 2018


Language
16

 G1 and G2 are equivalent if L(G1) = L(G2)


 A → α1, A → α2....... A → αm said to be
A-productions, rewritten as
A → α1 |α2|.....αm

Beulah A. July 26, 2018


Summary
 Definition of Grammar
 Notations followed in grammar
 Different types of grammar
 Language of a grammar

Beulah A. July 26, 2018


Test Your Knowledge
 The entity which generate Language is termed as:
a) Automata
b) Tokens
c) Grammar
d) Data
 The minimum number of productions required to
produce a language consisting of palindrome
strings over ∑={a,b} is
a) 3
b) 7 c) 5 d) 6
Beulah A. July 26, 2018
Test Your Knowledge
19

 The Grammar can be defined as: G=(V, ∑, p, S)


In the given definition, what does S represents?
a) Accepting State
b) Starting Variable
c) Sensitive Grammar
d) None of these

Beulah A. July 26, 2018


Reference
 Hopcroft J.E., Motwani R. and Ullman J.D,
“Introduction to Automata Theory, Languages and
Computations”, Second Edition, Pearson
Education, 2008

Beulah A. July 26, 2018

You might also like