Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for compiler-tokenization
41
votes
7
answers
1
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$
Kathleen
36.4k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2000
compiler-design
compiler-tokenization
easy
isro2015
+
–
3
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 26
A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$ Rule1: aa*b*c* { print ( T1 ); } Rule2: c { print ( T2 ); ... never be used? Note that the analyzer outputs the token that matches the longest possible prefix. Rule$1$ Rule$2$ Rule$3$ Rule$4$
A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$Rule1: aa*b*c* { print...
GO Classes
586
views
GO Classes
asked
Jan 13
Compiler Design
goclasses2024-mockgate-11
goclasses
compiler-design
lexical-analysis
compiler-tokenization
multiple-selects
1-mark
+
–
0
votes
4
answers
3
NIELIT 2018-56
Identify the total number of tokens in the given statement printf("A%B=",&i); $7$ $8$ $9$ $13$
Identify the total number of tokens in the given statementprintf("A%B=",&i);$7$$8$$9$$13$
Arjun
2.6k
views
Arjun
asked
Dec 7, 2018
Compiler Design
nielit-2018
compiler-design
compiler-tokenization
+
–
3
votes
3
answers
4
ISRO2020-13
The number of tokens in the following C code segment is switch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; } $27$ $29$ $26$ $24$
The number of tokens in the following C code segment isswitch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; }$27$$29$$26$$24$
Satbir
5.0k
views
Satbir
asked
Jan 13, 2020
Compiler Design
isro-2020
compiler-design
compiler-tokenization
easy
+
–
6
votes
1
answer
5
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
+
–
1
votes
3
answers
6
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
+
–
2
votes
2
answers
7
NIELIT Scientific Assistant A 2020 November: 100
The number of tokens in the following C/C++ statement is : printf("i=%d, &i=%xx", i&i); $9$ $6$ $10$ $12$
The number of tokens in the following C/C++ statement is :printf("i=%d, &i=%xx", i&i);$9$$6$$10$$12$
gatecse
574
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
lexical-analysis
compiler-tokenization
+
–
6
votes
7
answers
8
Type of error
Find the type of error produced by the following C code. main() { in/*comment t x; floa/*comment*/t gate; } Lexical error syntax error both a) and b) None of these
Find the type of error produced by the following C code.main() { in/*comment t x; floa/*comment*/t gate; }Lexical errorsyntax errorboth a) and b) None of these
Ashwani Kumar 2
5.2k
views
Ashwani Kumar 2
asked
Feb 7, 2017
Compiler Design
lexical-analysis
syntax-analysis
compiler-tokenization
+
–
0
votes
1
answer
9
Ullman (Compiler Design) Edition 2 Exercise 3.1 Question 2 (Page No. 114 - 115)
Tagged languages like HTML or XML are different from conventional programming languages in that the punctuation (tags) are either very numerous (as in HTML) or a user-definable set (as in XML). Further ... P> into appropriate lexemes. Which lexemes should get associated lexical values,and what should those values be?
Tagged languages like HTML or XML are different from conventional programming languages in that the punctuation (tags) are either very numerous (as in HTML) or a user-def...
admin
1.0k
views
admin
asked
Jul 27, 2019
Compiler Design
ullman
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
votes
1
answer
10
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
+
–
2
votes
5
answers
11
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
+
–
6
votes
3
answers
12
Calculating number of tokens
Given solution: Please explain how the number of tokens are 11.
Given solution:Please explain how the number of tokens are 11.
shikharV
18.5k
views
shikharV
asked
Jan 19, 2016
Compiler Design
compiler-tokenization
compiler-design
testbook-test-series
numerical-answers
+
–
3
votes
4
answers
13
Number of tokens in int a[5];
Number of tokens in $\text{int a[5];}$
Number of tokens in $\text{int a[5];}$
Deepak Singh 7
1.2k
views
Deepak Singh 7
asked
Mar 15, 2018
Compiler Design
compiler-design
compiler-tokenization
+
–
1
votes
2
answers
14
No of Tokens
Find no of Tokens in bellow program int main() { a=b+c; "printf("%d%d%d,a,b,c")"; } nd my other doubt is if we replace a=b+c to "a=b+c or a=b+c" will it give lexical error nd if ,then in which case.
Find no of Tokens in bellow programint main(){ a=b+c;"printf("%d%d%d,a,b,c")";}nd my other doubt is if we replace a=b+c to "a=b+c or a=b+c" will it give lexical error n...
saurabh rai
2.8k
views
saurabh rai
asked
Nov 15, 2016
Compiler Design
compiler-tokenization
compiler-design
+
–
2
votes
2
answers
15
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...
Rhythm
4.0k
views
Rhythm
asked
Jun 5, 2019
Compiler Design
lexical-analysis
compiler-tokenization
+
–
1
votes
2
answers
16
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
+
–
3
votes
1
answer
17
Identify Tokens
Calculate total no of Tokens and also determine there types:- a) a9997.7b884.cddf2.77 b) 74>><<2gfh0012 c) a>=ab.785!lklk d) a9997.b884.100intcddfloat2.77 Q2) Differentiate between Tokens, Lexeme and Pattern with the help of example Eg. int a;
Calculate total no of Tokens and also determine there types:-a) a9997.7b884.cddf2.77b) 74>><<2gfh0012c) a>=ab.785!lklkd) a9997.b884.100intcddfloat2.77Q2) Differentia...
Shubhanshu
574
views
Shubhanshu
asked
Aug 29, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
0
votes
2
answers
18
Counting number of lexemes
The number of lexemes in the statement in FORTRAN DO 10 I = 100 is __________ .
The number of lexemes in the statement in FORTRANDO 10 I = 100is __________ .
shikharV
1.9k
views
shikharV
asked
Nov 19, 2015
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
1
votes
1
answer
19
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
+
–
3
votes
0
answers
20
Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 1 (Page No. 125)
Consult the language reference manuals to determine the sets of characters that form the input alphabet (excluding those that may only appear in character strings or comments), the lexical form of numerical constants, and the lexical form of identifiers, for each of the following languages: C C++ C# Fortran Java Lisp SQL
Consult the language reference manuals to determinethe sets of characters that form the input alphabet (excluding those that may only appear in character strings or comme...
admin
1.1k
views
admin
asked
Aug 5, 2019
Compiler Design
ullman
compiler-design
lexical-analysis
compiler-tokenization
descriptive
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register