Question Discussion & Solution

MCQ

Here is a context-free grammar G: S ? AB A ? 0A1 | 2 B ? 1B | 3A which of the following strings are in L (G)?

021300211

022111300211

None of the mentioned

Both of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

All ___________ are automatically treated as regular expressions.

Programmatic description

Window

Win Object

Collection

Discussion

MCQ

?-transitions does not add any extra capacity of recognizing formal

True

False

May be

Can't say

Discussion

MCQ

The RE in which any number of 0?s is followed by any number of 1?s followed by any number of 2?s is?

(0+1+2)*

0*1*2*

0* + 1 + 2

(0+1)*2*

Discussion

MCQ

Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.

L = {aaaa,aabb,bbaa,bbbb}

L = {abab,abaa,aaab,baaa}

L = {aaab,baba,bbaa,bbbb}

L = {aaaa,abab,bbaa,aaab}

Discussion

MCQ

Which of the following languages is/are regular?
L1: {wxwR ? w, x ? {a, b}* and ?w?, ?x? >0} wR is the reverse of string w

L2: {anbm ?m ? n and m, n?0

L3: {apbqcr ? p, q, r ? 0}

L1 and L3 only

L2 and L3 only

L3 only

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics