Push down automata excepts which language ?...

MCQ

Push down automata excepts which language ?

Context Sensitive Language

Context free Language

Recursive Language

None 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

Which of these does not belong to CFG?

Terminal Symbol

Non terminal Symbol

Start symbol

End Symbol

Discussion

MCQ

Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (*,*) in the operator precedence table constructed for the grammar.

All <

All >

< >, =

< > > >

Discussion

MCQ

Are ambiguous grammar context free?

Yes

Discussion

MCQ

The set of all strings over ? = {a,b} in which all strings that starts with and ends with same letter is--------

[a(a+b)*b + b(a+b)*a]

[a(a+b)*a + b(a+b)*b]

a(a+b)*a

b(a+b)*b

Discussion

MCQ

Which of the following statement is false?

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variable

In derivation tree, if the root of a sub tree is X then it is called

None of these

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 Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars