Scribd Logo
Upload

Welcome to Scribd!

  • Practice Questions CNF GNF PDA

    Uploaded by

    Sinan Ahmed
    15 views1 page
    This document provides practice problems for converting context-free grammars (CFGs) into Chomsky normal form (CNF) and Greibach normal form (GNF), as well as constructing pushdown automata (PDAs) for specific languages. Problem 1 asks to convert a CFG into CNF with rules S → ASA | aB, A→B|S, and B→b|∈. Problem 2 asks to convert a CFG into GNF with rules S → CA | BB, B → b | SB, and C→b, A→a. Problem 3 asks to construct a PDA with rules and diagram to recognize the language wcwR, where w is a string and wR is

    Original Description:

    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
    This document provides practice problems for converting context-free grammars (CFGs) into Chomsky normal form (CNF) and Greibach normal form (GNF), as well as constructing pushdown automata (PDAs) for specific languages. Problem 1 asks to convert a CFG into CNF with rules S → ASA | aB, A→B|S, and B→b|∈. Problem 2 asks to convert a CFG into GNF with rules S → CA | BB, B → b | SB, and C→b, A→a. Problem 3 asks to construct a PDA with rules and diagram to recognize the language wcwR, where w is a string and wR is

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Practice Questions CNF GNF PDA

    Uploaded by

    Sinan Ahmed
    This document provides practice problems for converting context-free grammars (CFGs) into Chomsky normal form (CNF) and Greibach normal form (GNF), as well as constructing pushdown automata (PDAs) for specific languages. Problem 1 asks to convert a CFG into CNF with rules S → ASA | aB, A→B|S, and B→b|∈. Problem 2 asks to convert a CFG into GNF with rules S → CA | BB, B → b | SB, and C→b, A→a. Problem 3 asks to construct a PDA with rules and diagram to recognize the language wcwR, where w is a string and wR is

    Copyright:

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

    PRACTICE PROBLEMS BASED ON CNF AND GNF

    Problem-01:

    Convert following CFG into CNF

    S → ASA | aB
    A→B|S
    B→b|∈
    C → ab | ∈

    Problem-02:
    Convert following CFG into GNF

    S → CA | BB
    B → b | SB
    C→b
    A→a

    PRACTICE PROBLEMS BASED ON PDA

    Problem-03:

    Construct PDA for following languages


    1.
    wcwR

    Write rules also draw diagram for PDA

    You might also like