Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Context Free Grammar

    Uploaded by

    vshlvvk
    This document discusses context-free grammars for generating different types of languages, including: 1) The language b* using rules S->bS and S-># to recursively generate strings of b's. 2) Generating palindromes using rules like S->aSa and S->bSb to recursively add matching prefix and suffix letters. 3) The language (a+b)* using rules S->aS, S->bS, and S-># to recursively add a's and b's or end the string.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Context Free Grammar

    Uploaded by

    vshlvvk
    18 views7 pages
    This document discusses context-free grammars for generating different types of languages, including: 1) The language b* using rules S->bS and S-># to recursively generate strings of b's. 2) Generating palindromes using rules like S->aSa and S->bSb to recursively add matching prefix and suffix letters. 3) The language (a+b)* using rules S->aS, S->bS, and S-># to recursively add a's and b's or end the string.

    Original Description:

    Production rules and explanation

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses context-free grammars for generating different types of languages, including: 1) The language b* using rules S->bS and S-># to recursively generate strings of b's. 2) Generating palindromes using rules like S->aSa and S->bSb to recursively add matching prefix and suffix letters. 3) The language (a+b)* using rules S->aS, S->bS, and S-># to recursively add a's and b's or end the string.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    18 views7 pages

    Context Free Grammar

    Uploaded by

    vshlvvk
    This document discusses context-free grammars for generating different types of languages, including: 1) The language b* using rules S->bS and S-># to recursively generate strings of b's. 2) Generating palindromes using rules like S->aSa and S->bSb to recursively add matching prefix and suffix letters. 3) The language (a+b)* using rules S->aS, S->bS, and S-># to recursively add a's and b's or end the string.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 7

    Context Free Grammar/Language

    PPL,CS-403

    Generate the language b*


    Rule1: S->bS Rule2: S-> # S-> bS bbS bbbS bbbbS bbbbbS bbbbb#

    To generate aaa?
    S -> SS S -> a S -> # S -> SS aS aSS aaS aaa S
    S S

    n n a b
    S -> aSb S -> # S -> aSb aaSbb aaaSbbb aaaaSbbbb aaaa#bbbb aaaabbbb

    Palindrome
    S -> aSa S -> bSb S -> a S -> b S -> #
    To generate abbababba?

    S -> aSa -> abSba -> abbSbba -> abbaSabba -> abbababba

    (a+b)*
    S -> aS | bS |# To generate the string ababba S -> aS abS ab

    Non palindrome
    S -> aXb|bXa X -> # | aX | bX S -> aSa|bSb To derive abba S -> aSa abSba ??

    You might also like