Register
Filter

Recent activity by Ravijha

1 answer
2
Difference between computability and decidability
Hi, Could someone please tell the difference between computability and decidability? Thanks
Hi,Could someone please tell the difference between computability and decidability?Thanks
1 answer
5
Test by Bikram | Compiler Design | Test 1 | Question: 10
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________. LL(1) grammar Unambiguous grammar Operator grammar Context Sensitive grammar
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________.LL(1) grammarUnambiguous grammarOperator gramm...
1 answer
7
Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar: $E \rightarrow E + T \mid T$ $T \rightarrow T ^* F \mid F$ $F \rightarrow (E) \mid id$ ... $E \rightarrow TE' , \ \ T \rightarrow FT' , \ \ F \rightarrow (E) \mid id$
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
1 answer
8
Test by Bikram | Compiler Design | Test 1 | Question: 26
In compilers, the type checking is done in: Lexical Analysis Semantic Analysis Code Generation Phase Parsing Phase
In compilers, the type checking is done in:Lexical AnalysisSemantic AnalysisCode Generation PhaseParsing Phase
2 answers
10
token generation doubt
which one of the following string can definitely said to be a token without looking at the next input: +(++,+=) return(return a) *(*=) =(==) ++ , ( ) ‘ ; option e is: plusplus, comma, bracket open, bracket close, single quote ;
which one of the following string can definitely said to be a token without looking at the next input:+(++,+=)return(return a)*(*=)=(==)++ , ( ) ‘ ; option e is: plu...
1 answer
12
Test by Bikram | Compiler Design | Test 1 | Question: 4
A top-down parser generates ________________. right-most derivation right-most derivation in reverse left-most derivation left-most derivation in reverse
A top-down parser generates ________________.right-most derivationright-most derivation in reverseleft-most derivationleft-most derivation in reverse
3 answers
21
Lexical analyser, Tokens
When do we count ++(post increment or pre increment) as 1 or 2 token ?
When do we count ++(post increment or pre increment) as 1 or 2 token ?
2 answers
22
Gate CS
#include<stdio.h> int main() { int x, y = 7; x = ++y + ++y + y--; printf("%d\n", x); return 0; } What is the output of this code snippet ? A. 27 B. 26 C. 25 D. Compilation error
#include<stdio.h int main() { int x, y = 7; x = ++y + ++y + y ; printf("%d\n", x); return 0; }What is the output of this code snippet ?A. 27B. 26C. 25D. Compilation error...
2 answers
23
TOC DCFL vs CFL
1. L ={ a^n b^m c^x d^y | n=m or x=y} 2. L ={ a^n b^x c^m d^y | n=m or x=y} Classify above in CFL/DCFL?
1. L ={ a^n b^m c^x d^y | n=m or x=y}2. L ={ a^n b^x c^m d^y | n=m or x=y}Classify above in CFL/DCFL?
2 answers
24
Lexical Analysis
What are different set of characters which are taken as single token in lexical analysis in compiler design? For eg. Charaters under double quotes are taken as single token, post-increment and pre-increment is taken as single token etc.
What are different set of characters which are taken as single token in lexical analysis in compiler design?For eg. Charaters under double quotes are taken as single toke...
5 answers
27
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
What it the number of tokens in the following line?printf("%d numbers.", &x);
2 answers
28
MadeEasy Test Series: Compiler Design - Lexical Analysis
int main() { int a,b; a=10; b=15; printf("a=%d,b=%d",a++,b--); } The number of tokens in the above C program is_________. I am getting 30 The answer given is 29
int main() { int a,b; a=10; b=15; printf("a=%d,b=%d",a++,b ); }The number of tokens in the above C program is_________.I am getting 30The answer given is 29
4 answers
30
Regular Expression
Can I write $a^* + b^* = (a + b)^*$ ????
Can I write $a^* + b^* = (a + b)^*$ ????