Scribd Logo
Upload

Welcome to Scribd!

  • Context Free Grammar: By: Dr. Archana Gupta

    Uploaded by

    Acne Terminator
    4 views56 pages
    The document discusses context free grammars (CFG) and provides examples of CFG for different languages: 1) A CFG consists of variables (V), terminals (T), production rules (P), and a starting variable (S). Production rules are of the form A-> α, where α contains variables and/or terminals. 2) Examples of CFGs are provided for arithmetic expressions, strings with an even number of characters, and languages with an equal number of a's and b's. 3) The document also discusses different normal forms for CFGs including Chomsky normal form (CNF) and Greibach normal form (GNF).

    Original Description:

    Original Title

    CFG

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses context free grammars (CFG) and provides examples of CFG for different languages: 1) A CFG consists of variables (V), terminals (T), production rules (P), and a starting variable (S). Production rules are of the form A-> α, where α contains variables and/or terminals. 2) Examples of CFGs are provided for arithmetic expressions, strings with an even number of characters, and languages with an equal number of a's and b's. 3) The document also discusses different normal forms for CFGs including Chomsky normal form (CNF) and Greibach normal form (GNF).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views56 pages

    Context Free Grammar: By: Dr. Archana Gupta

    Uploaded by

    Acne Terminator
    The document discusses context free grammars (CFG) and provides examples of CFG for different languages: 1) A CFG consists of variables (V), terminals (T), production rules (P), and a starting variable (S). Production rules are of the form A-> α, where α contains variables and/or terminals. 2) Examples of CFGs are provided for arithmetic expressions, strings with an even number of characters, and languages with an equal number of a's and b's. 3) The document also discusses different normal forms for CFGs including Chomsky normal form (CNF) and Greibach normal form (GNF).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 56

    Context Free Grammar

    By:
    Dr. Archana Gupta
    CFG
    • Formal notation for expressing recursive
    definition in language like palindrome.
    • A->0
    • A->1
    • A->0A0
    • A->1A1
    • A->epsilon
    Formal definition
    • V
    • T
    • P
    • S
    • P consist of rules in the form A-> α
    where α ∈ (VUT)* and A ∈ V,
    CFG for Arithmetic Grammar
    |i=j+k
    |i<=2j
    Strings of even length
    Identify the language of the grammar
    • S->aS/Sb/a/b
    • Prove that “ba” is not substring
    Equal number of a’s and b’s
    Derivation
    Leftmost and Rightmost Derivation
    Parse Tree
    CNF
    • S → 1A / 0B
    • A → 1AA / 0S / 0
    • B → 0BB / 1S / 1
    GNF
    • S->aAbB
    • A->aAa/a
    • B->bBb/b
    GNF
    • S → aB | AA
    • A → a | aBA | AAA
    • B→b
    • X→a
    GNF
    • S→ABb|a
    • A→aaA|B
    • B→bAb
    GNF
    • S→AA | 1,
    • A→SS |0
    • S -> CA
    • S -> BB
    • B -> b
    • B -> SB
    • A -> a
    GNF
    • S→aAa | bBb |€
    • A→C|a
    • B→C|b
    • C→CDE | €
    • D→A|B|ab

    You might also like