aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Online Test 1 - Compiler | Computer Science(CS)
  • The language L = {ak bk |k$\ge$1} is
Multiple choice

The language L = {ak bk |k$\ge$1} is

  1. type 3 grammar

  2. type 1 grammar

  3. type 2 grammar

  4. type 0 grammar

Reveal answer Fill a bubble to check yourself
B Correct answer

Keep practicing — related questions

  • Consider the flowing grammar C S $\rightarrow$ bS |aA| b A$\rightarrow$ bA | aB B bB |aS| a Let Na (W) and ...
  • The language {ambm+n | m,n $\le$ 1} is
  • Consider the grammar: G1=({S,S1,S2},{a,b},S,P), with the following productions: P:S → S1bc,S1→ S1bc|S2,S2 →...
  • Natural is a ------ GL language.
  • Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
  • Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
  • Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
  • Consider the languages L1 {an bn cm | n, m > 0} and L2 {an bm cm | n, m > 0}
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy