Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Chandan1990
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Chandan1990
2
answers
1
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b. How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choice.So how can i remove choice in this and make it deterministic?
Following is the PDA that accept equal number of a and b.How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choic...
2.3k
views
commented
Nov 21, 2017
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
deterministic-context-free-grammars
+
–
1
answer
2
#maddeasy test series
L is decidable or undecidable??
L is decidable or undecidable??
310
views
commented
Nov 20, 2017
0
answers
3
Run time Enviornment
I am reading a local book on compilers. Author says that Memory required by data objects could be determined at compile time. if size is to be determined at runtime like giving number of element in array using user input than does above claim hold valid. I have doubt over his statement. Kindly comment.
I am reading a local book on compilers. Author says that Memory required by data objects could be determined at compile time. if size is to be determined at runtime like...
222
views
asked
Nov 12, 2017
Compiler Design
compiler-design
+
–
0
answers
4
Not from book
1. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* a) € b) a* c) All of the mentioned d) None of the mentioned View Answer
1. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*a) €b) a*c) All of the mentionedd) None of the mentionedView Answer
216
views
asked
Nov 11, 2017
5
answers
5
Operator Precedence
In Operator precedence parsing, precedence relations are defined, i. for all pair of non-terminals. ii. for all pair of terminals. iii. to delimit the handle. iv. only for certain pair of terminals.
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
2.1k
views
answered
Oct 30, 2017
Compiler Design
compiler-design
operator-grammar
+
–
1
answer
6
Compiler Design : First & Follow
is it correct ?
is it correct ?
6.0k
views
commented
Oct 16, 2017
Compiler Design
first-and-follow
compiler-design
+
–
1
answer
7
P and C doubt
Number of ways in which the corner of the square can coloured with two colours. It is permissible to use single colour on all four corners?
Number of ways in which the corner of the square can coloured with two colours.It is permissible to use single colour on all four corners?
953
views
commented
Oct 14, 2017
Combinatory
burnsides-theorem
+
–
7
answers
8
MadeEasy Subject Test: Theory of Computation - Identify Class Language
Consider the following language, $L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ |x| = |y| \big\}$ The language is ___________. Regular CFL but not regular CSL but not CFL Recursive but not CSL
Consider the following language,$L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ |x| = |y| \big\}$The language is ___________.RegularCFL ...
3.9k
views
commented
Oct 13, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
1
answer
9
Compiler Lexical analyzer
int main() { print("%d",a); return 0; } If i execute,i will get error as:- prog.c:112:17: error: 'a' undeclared (first use in this function) printf("%d",a); Now as this is the semantic error,so how ... analyzer can give the row number and column number of error as it tokenize the entire program but is this also possible in sematic analyzer?
int main(){ print("%d",a); return 0;}If i execute,i will get error as:- prog.c:112:17: error: 'a' undeclared (first use in this function) printf("%d",a);Now as this...
710
views
answered
Oct 10, 2017
Compiler Design
lexical-analysis
compiler-design
compiler-tokenization
+
–
0
answers
10
Regular language
{XWWrY} is regular or not? XYW € (0,1)+
{XWWrY} is regular or not?XYW € (0,1)+
358
views
commented
Oct 6, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
11
Theory of Computation - Show that an algorithm exists for determining if L contains any strings of even length.
Let L be any regular language on Σ = {a, b}. Show that an algorithm exists for determining if L contains any strings of even length.
490
views
answered
Oct 5, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-language
regular-expression
+
–
1
answer
12
Union
How to calculate the union of two regular expression? Kindly explain with an example. Thank you.
How to calculate the union of two regular expression? Kindly explain with an example. Thank you.
190
views
answered
Oct 2, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
13
UGC NET CSE | June 2009 | Part 2 | Question: 35
Any syntactic construct that can be described by a regular expression can also be described by a : Context sensitive grammar Non context free grammar Context free grammar None of the above
Any syntactic construct that can be described by a regular expression can also be described by a :Context sensitive grammar Non context free grammar Context free gramm...
1.5k
views
answered
Oct 1, 2017
Theory of Computation
ugcnetcse-june2009-paper2
+
–
2
answers
14
REGULAR GRAMMARS
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars? (a) S → ε, A → aS|b (b) A → aB|a, B → bA|b (c) A → Ba|Bab (d) A → abB|aB please explain how u proceed? The answer is given "b"
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars?(a) S → ε, A → aS|b (b) A → aB|a, B → bA|b(c) A → Ba|B...
3.0k
views
answered
Oct 1, 2017
Compiler Design
regular-grammar
compiler-design
regular-language
+
–
1
answer
15
ace test series
Choose appropriate context free language l2..
Choose appropriate context free language l2..
220
views
answered
Sep 27, 2017
1
answer
16
doubt: Closure Property
Let Exchange(L1) : { XwY | YwX ∈ L1 , X,Y∈ Σ } Is Exchange(L1) closed or regular? If yes please give some prove .
Let Exchange(L1) : { XwY | YwX ∈ L1 , X,Y∈ Σ }Is Exchange(L1) closed or regular?If yes please give some prove .
220
views
answered
Sep 27, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register