Ask
Login
0
15kviews
Explain with an example the Chomsky hierarchy.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 3.5 years ago
theory of computation
ADD COMMENT EDIT
1 Answer
1
1.2kviews
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k

Chomsky hierarchy:

The Chomsky hierarchy classifies the formal language in the four types:

  1. Type 0: Unrestricted grammar

  2. Type 1: Restricted grammar (Context-sensitive)

  3. Type 2: Context free grammar

  4. Type 3: Regular grammar

enter image description here

The formal languages take the form of productions, like α → β

Fig 1. Chomsky hierarchy

Fig 1 describes …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.