Header Ads

  • Highlights

    👩🏻‍💻 Hello Readers 🧑🏻‍💻!!! Would you like to Explore more ? Hit on ⓘ(Ads)... ✨🌹

    Comparative study of Chomsky Grammar Classification

    Comparative study of Chomsky Grammar Classification


    Type

    Grammar

    Accepted by

    Production Rule

    Example

    Type

    0

    Unrestricted

    Grammar
    Turing Machine (TM)

    1. x must have at least one variable (V)

    2. y can be any string which consist any combination of variable (V) and terminal (T)

    AB → a | Ba

    Type

    1

    Unrestricted
    Grammar
    Linear Bounded
    Automata (L
    BA)

    1. x must have at least one variable (V)

    2.y can be any string which consist combination of variable (V) and terminal (T)

    3.Length of y should be less than or equal to x.

    Aa → aAb | aB | Cb

    Type

    2

    Context Free
    Grammar
    Push Down
    Automata (P
    DA)

    1. x can have exactly one Variable (V)

    2. y can be any string which consist combination of variable (V) and terminal (T)

    3. Length of y should be less than or equal to x.

    A → aBa | aB | Ba

    Type

    3

    Regular
    Grammar
    Finite Automata (FA)

    1. x can have exactly one Variable (V)

    2. y can be any string which consist any combination from (VT*, T*V, T*), where V = one variable and T* = any number of terminals

    3.Length of y should be less than or equal to x.

    A → a | Bb | bB
     

     




























    Also, Study about: 

    Also Read, some interview tips

    No comments

    Post Bottom Ad

    Powered by Blogger.