Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged lexical-analysis
1
votes
2
answers
31
Made easy question of compiler design
Find the number of tokens in the following C code$:$ main() { int x = 10 , *P ; int y = x ++ ; char * q ; P = & x ; q = 'A' ; if(*P>=10) { *P = x + 100; } else { printf("%d" , x); /*comment*/ } }
Find the number of tokens in the following C code$:$main() { int x = 10 , *P ; int y = x ++ ; char * q ; P = & x ; q = 'A' ; if(*P>=10) { *P = x + 100; ...
Shubham_Kr
3.1k
views
Shubham_Kr
asked
Apr 11, 2019
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
made-easy-booklet
numerical-answers
+
–
0
votes
3
answers
32
Error during compilation
fro(int I=0; I <5;I++); what kind of compilation error is this ?
fro(int I=0; I <5;I++);what kind of compilation error is this ?
VJ2793
641
views
VJ2793
asked
Feb 12, 2019
Compiler Design
compiler-design
lexical-analysis
descriptive
+
–
2
votes
3
answers
33
Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?
How many tokens in thisa>>=1;and a! , Will >>= and a! be treated as a single token ?
kman30
1.7k
views
kman30
asked
Jan 21, 2019
Compiler Design
compiler-design
lexical-analysis
+
–
0
votes
2
answers
34
Compiler Design
Type of ERROR
Type of ERROR
balchandar reddy san
981
views
balchandar reddy san
asked
Jan 19, 2019
Compiler Design
compiler-design
lexical-analysis
test-series
+
–
0
votes
1
answer
35
compiler design Lexical Errors (Applied Gate mock -3 )
Which of the following error will not come under Lexical error (Compiler Design - 1Mark) Spelling error Exceeding length of an identifier or numeric constants Appearance of illegal characters Missing semicolon A. I only B. II only C. III ... whiel, instead of keyword it would be recognized as variable ... Can any one explain what is true...
Which of the following error will not come under Lexical error (Compiler Design - 1Mark)Spelling errorExceeding length of an identifier or numeric constantsAppearance of ...
Prasad Budithi
3.9k
views
Prasad Budithi
asked
Jan 16, 2019
Compiler Design
compiler-design
lexical-analysis
applied-gate-test-series
+
–
1
votes
0
answers
36
UPPCL AE 2018:35
Which phase during compilation does a compiler recognize the $\textbf{keywords}$ of a language? Code generation Parsing Dataflow analysis Lexical analysis
Which phase during compilation does a compiler recognize the $\textbf{keywords}$ of a language?Code generationParsingDataflow analysisLexical analysis
admin
258
views
admin
asked
Jan 5, 2019
Compiler Design
uppcl2018
compiler-design
lexical-analysis
+
–
1
votes
0
answers
37
UPPCL AE 2018:27
Which of the following data structures is used by a compiler to manage information about variables and their attributes? abstract syntax tree symbol table semantic stack parse table
Which of the following data structures is used by a compiler to manage information about variables and their attributes?abstract syntax treesymbol tablesemantic stackpars...
admin
227
views
admin
asked
Jan 5, 2019
Compiler Design
uppcl2018
compiler-design
lexical-analysis
+
–
1
votes
0
answers
38
UPPCL AE 2018:7
The lexical analysis for a modern computer language like Java necessarily needs the power of which one of the following machine models? Turing machine Non-deterministic Pushdown automata Finite automata Deterministic Pushdown automata
The lexical analysis for a modern computer language like Java necessarily needs the power of which one of the following machine models?Turing machineNon-deterministic Pus...
admin
248
views
admin
asked
Jan 5, 2019
Compiler Design
uppcl2018
compiler-design
lexical-analysis
+
–
3
votes
2
answers
39
Geeks for geeks gate 2016 mock
In the Lexical Analysis, regular expression can be used to model A) the structures of lexemes with fixed length identifier excluded B) the structure of tokens C) the structure of tokens but not lexemes D) the structure of lexemes with variable length identifier included
In the Lexical Analysis, regular expression can be used to modelA) the structures of lexemes with fixed length identifier excludedB) the structure of tokensC) the structu...
Prince Sindhiya
2.1k
views
Prince Sindhiya
asked
Dec 27, 2018
Compiler Design
compiler-design
lexical-analysis
+
–
0
votes
1
answer
40
Self doubt
int main() { int a,b; a = 10; b = 11; printf(“%d %d”, a++,b--); } The number of tokens is
int main(){ int a,b; a = 10; b = 11; printf(“%d %d”, a++,b );}The number of tokens is
Vipin Rai
568
views
Vipin Rai
asked
Dec 12, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
votes
1
answer
41
Test Book- Complier Design
Consider the following issues Simplifies the phases. Compiler efficiency is improved. Compiler works faster. Does not require a stack. Which is/are true in context of lexical analysis? pls provide an explanation as well..
Consider the following issuesSimplifies the phases.Compiler efficiency is improved.Compiler works faster.Does not require a stack.Which is/are true in context of lexical ...
anjali007
613
views
anjali007
asked
Nov 28, 2018
Compiler Design
compiler-design
lexical-analysis
testbook-test-series
+
–
4
votes
2
answers
42
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
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Nov 23, 2018
Compiler Design
compiler-design
lexical-analysis
made-easy-test-series
+
–
2
votes
5
answers
43
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);
Mizuki
1.8k
views
Mizuki
asked
Nov 11, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
1
votes
2
answers
44
Lexical Analysis
How will the compiler detect whether "if" is a keyword or an identifier? Please tell me the concept behind this.
How will the compiler detect whether "if" is a keyword or an identifier?Please tell me the concept behind this.
Lovejeet Singh
1.2k
views
Lovejeet Singh
asked
Nov 7, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
usergate2018
usermod
+
–
0
votes
1
answer
45
TANCET 2017 COMPILER DESIGN
For which of the following reasons, a compiler is preferable to an interpreter? It can generate stand-alone programs that often takes less time for execution It is much helpful in the initial stages of program development Debugging can be faster and easier If one changes a statement, only that statement needs recompilation
For which of the following reasons, a compiler is preferable to an interpreter?It can generate stand-alone programs that often takes less time for executionIt is much hel...
Balaji Jegan
582
views
Balaji Jegan
asked
Oct 23, 2018
Compiler Design
tancet
compiler-design
lexical-analysis
+
–
1
votes
3
answers
46
TANCET 2016 Lexical Analysis
Consider the following statements $S_{1}:$ The set of string described by a rule is called pattern associated with the token. $S_{2}:$ A lexeme is a sequence of character in the source program that is matched by Pattern for a token. Which of the following statement is/are true? ... $S_{2}$ is false $S_{2}$ is true $S_{1}$ is false Both $S_{1}$ and $S_{2}$ are false
Consider the following statements$S_{1}:$ The set of string described by a rule is called pattern associated with the token.$S_{2}:$ A lexeme is a sequence of character i...
Balaji Jegan
4.1k
views
Balaji Jegan
asked
Oct 23, 2018
Compiler Design
tancet
compiler-design
lexical-analysis
compiler-tokenization
+
–
6
votes
1
answer
47
Lexical Analysis
Consider the following code $x = (y + 5) + (^*z) * 10 - x /3 $ Which of the following correctly identified by lexical analysis after scanning the above code? 5 Identifiers 3 literals 4 Identifiers 6 literals
Consider the following code$x = (y + 5) + (^*z) * 10 - x /3 $Which of the following correctly identified by lexical analysis after scanning the above code?5 Identifiers...
Mk Utkarsh
1.8k
views
Mk Utkarsh
asked
Oct 22, 2018
Compiler Design
compiler-design
lexical-analysis
+
–
0
votes
2
answers
48
Finite automata
The application of finite automata include:- a)Lexical Analyzer b)Text Editor c)Operating System d)All of the above
The application of finite automata include:-a)Lexical Analyzerb)Text Editorc)Operating Systemd)All of the above
saumya mishra
1.1k
views
saumya mishra
asked
Oct 11, 2018
Compiler Design
compiler-design
finite-automata
lexical-analysis
+
–
6
votes
7
answers
49
Lexical vs Syntax Error
Na462
3.4k
views
Na462
asked
Oct 5, 2018
Compiler Design
compiler-design
lexical-analysis
ace-test-series
+
–
0
votes
1
answer
50
number of tokens
Question: Find the number of tokens in the following C code using lexical analyzer of the compiler.
Question:Find the number of tokens in the following C code using lexical analyzer of the compiler.
syncronizing
5.3k
views
syncronizing
asked
Sep 21, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
+
–
1
votes
1
answer
51
Find the no. of tokens
Find no of tokens in below program. #include<stdio.h> main() { int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5); }
Find no of tokens in below program.#include<stdio.h>main(){ int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5);}
sagar27
5.2k
views
sagar27
asked
Sep 21, 2018
Compiler Design
compiler-tokenization
lexical-analysis
+
–
7
votes
5
answers
52
MadeEasy Subject Test 2019: Compiler Design - Lexical Analysis
abhishekmehta4u
2.5k
views
abhishekmehta4u
asked
Sep 11, 2018
Compiler Design
made-easy-test-series
lexical-analysis
+
–
0
votes
0
answers
53
lexical analysis
turendar
331
views
turendar
asked
Sep 5, 2018
Compiler Design
ugcnet
lexical-analysis
+
–
0
votes
1
answer
54
Printf("j=%d,&,j=%x",j&j)
Nageswara Rao G
945
views
Nageswara Rao G
asked
Aug 22, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
3
votes
0
answers
55
MadeEasy Test Series: Compiler Design - Lexical Analysis
Deepanshu
780
views
Deepanshu
asked
Aug 9, 2018
Compiler Design
made-easy-test-series
compiler-design
lexical-analysis
+
–
0
votes
2
answers
56
Number of tokens
In this question we will take n-=n1 as n=n-n1 as 5 tokens or n-=n1 as 4 tokens ????
In this question we will take n-=n1 as n=n-n1 as 5 tokens or n-=n1 as 4 tokens ????
saumya mishra
2.2k
views
saumya mishra
asked
Jun 12, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
test-series
+
–
0
votes
1
answer
57
compiler design
Shivani gaikawad
160
views
Shivani gaikawad
asked
Jun 7, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
test-series
+
–
1
votes
1
answer
58
[Compiler] Identify phase of error
int a = b+*/c; Which phase will give the error?Lexical or syntax?
int a = b+*/c;Which phase will give the error?Lexical or syntax?
rahul sharma 5
1.4k
views
rahul sharma 5
asked
Apr 28, 2018
Compiler Design
compiler-design
lexical-analysis
+
–
0
votes
0
answers
59
compile design syntax directed defination
Ronish Jariwala 1
480
views
Ronish Jariwala 1
asked
Apr 15, 2018
Compiler Design
syntax-directed-translation
compiler-design
lexical-analysis
block-nested-loop-join
+
–
6
votes
1
answer
60
Tokens vs Lexeme
What is the difference between lexeme and tokens?
What is the difference between lexeme and tokens?
Tech Geek
19.7k
views
Tech Geek
asked
Apr 3, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register