Question Discussion & Solution

MCQ

Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*

All of the mentioned

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 the following statement is correct?

A Context free language can be accepted by a deterministic PDA

union of 2 CFLs is context free

The intersection of two CFLs is context free

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 is NOT the set of regular expression R = (ab + abb)* bbab?

ababbbbab

abbbab

ababbabbbab

abababab

Discussion

MCQ

The grammar G: S ? SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G

bbb

All of the mentioned

None of the mentioned

Discussion

MCQ

Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa

2) aaaabaaaa

3) baaaaabaaaab

4) baaaaabaa

1, 2, 3

2, 3, 4

1, 2, 4

1, 3, 4

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