Question: The language of balanced paranthesis is

Options

A : regular

B : non regular

C : may be regular

D : none of the mentioned

Click to view Correct Answer

Previous || Next

Applications - Parsers more questions

Which of the following is an example of inherent ambiguous....

LALR in LALR parser stands for:

Pigeonhole principle can be applied in the following computer science....

State true or false:^ Statement: LALR parsers uses tables rather....

State true or false:^ Statement: Pumping lemma gives a necessary....

Which kind of proof is used to prove the regularity....

Which of the following can be a LALR parser generator?

Which of the following is true for a predictive parser?

Which of the following is/are an example of pigeon hole....

Which of the following parsers do not relate to Bottom....

Ambiguous Grammar more Online Exam Quiz

Neural Networks - 2

Robotics - 2

Rule Based System - 2

Semantic Net - 2

Ambiguous Grammar

Applications of DFA

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols

Deterministic Finite Automata-Introduction and Definition