Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged compiler-tokenization
3
votes
1
answer
1
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$
GO Classes
asked
in
Compiler Design
Jan 13
by
GO Classes
568
views
goclasses2024-mockgate-11
goclasses
compiler-design
lexical-analysis
compiler-tokenization
multiple-selects
1-mark
2
votes
2
answers
2
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$
gatecse
asked
in
Compiler Design
Dec 9, 2020
by
gatecse
562
views
nielit-sta-2020
compiler-design
lexical-analysis
compiler-tokenization
3
votes
3
answers
3
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$
Satbir
asked
in
Compiler Design
Jan 13, 2020
by
Satbir
5.0k
views
isro-2020
compiler-design
compiler-tokenization
easy
1
vote
0
answers
4
Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 4 (Page No. 125)
Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexeme is very simple. However, some languages, like SQL, are case insensitive, so a keyword ... in a case-insensitive language. Illustrate the idea by writing the expression for "select" in SQL.
Lakshman Bhaiya
asked
in
Compiler Design
Aug 5, 2019
by
Lakshman Bhaiya
1.1k
views
ullman
compiler-design
regular-expression
compiler-tokenization
descriptive
3
votes
0
answers
5
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
Lakshman Bhaiya
asked
in
Compiler Design
Aug 5, 2019
by
Lakshman Bhaiya
1.1k
views
ullman
compiler-design
lexical-analysis
compiler-tokenization
descriptive
0
votes
1
answer
6
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?
Lakshman Bhaiya
asked
in
Compiler Design
Jul 27, 2019
by
Lakshman Bhaiya
1.0k
views
ullman
compiler-design
lexical-analysis
compiler-tokenization
0
votes
0
answers
7
Ullman (Compiler Design) Edition 2 Exercise 3.1 Question 1 (Page No. 114)
Divide the following C + + program: float limitedSquare(x) float x { /* returns x-squared, but never more than 100 */ return (x<=-10.0 || x>=10.0)?100:x*x; } into appropriate lexemes, using the discussion of Section $3.1.2$ as a guide. Which lexemes should get associated lexical values? What should those values be?
Lakshman Bhaiya
asked
in
Compiler Design
Jul 27, 2019
by
Lakshman Bhaiya
1.3k
views
ullman
compiler-design
lexical-analysis
compiler-tokenization
3
votes
1
answer
8
Lexical Analysis: Self Doubt
The above diagram is Transition Diagrams for identifiers. As we can see that the identifier is said to be accepted if it starts with a letter and ends with a valid delimiter, which includes blank symbol, arithmetic, logical operator, left parenthesis, right ... with a delimiter and + is a valid delimiter and the error in declaration will not be detected at this stage...
Hirak
asked
in
Compiler Design
Jun 9, 2019
by
Hirak
1.8k
views
compiler-design
lexical-analysis
compiler-tokenization
2
votes
2
answers
9
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 ;
Rhythm
asked
in
Compiler Design
Jun 5, 2019
by
Rhythm
4.0k
views
lexical-analysis
compiler-tokenization
1
vote
2
answers
10
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*/ } }
Shubham_Kr
asked
in
Compiler Design
Apr 12, 2019
by
Shubham_Kr
3.0k
views
compiler-design
lexical-analysis
compiler-tokenization
made-easy-booklet
numerical-answers
0
votes
1
answer
11
UPPCL AE 2018:24
The number of tokens in the following $\text{C}$ statement is printf(“i = %d, j = %f, &i = %x\n”, i, j, &i); $10$ $35$ $46$ $12$
Lakshman Bhaiya
asked
in
Compiler Design
Jan 5, 2019
by
Lakshman Bhaiya
307
views
uppcl2018
compiler-design
compiler-tokenization
0
votes
1
answer
12
Self doubt
int main() { int a,b; a = 10; b = 11; printf(“%d %d”, a++,b--); } The number of tokens is
Vipin Rai
asked
in
Compiler Design
Dec 12, 2018
by
Vipin Rai
553
views
compiler-design
lexical-analysis
compiler-tokenization
0
votes
4
answers
13
NIELIT 2018-56
Identify the total number of tokens in the given statement printf("A%B=",&i); $7$ $8$ $9$ $13$
Arjun
asked
in
Compiler Design
Dec 7, 2018
by
Arjun
2.6k
views
nielit-2018
compiler-design
compiler-tokenization
1
vote
0
answers
14
Self Doubt Token Count - Character Literal
How many tokens are there ? int main() { char name={'A','A','K','A','S','H'}; return 0; } Please give any reference if possible, my doubt is about the characters in the braces, do we count them individually or like a string.
Aakash_
asked
in
Compiler Design
Nov 20, 2018
by
Aakash_
909
views
compiler-tokenization
compiler-design
2
votes
5
answers
15
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
Mizuki
asked
in
Compiler Design
Nov 11, 2018
by
Mizuki
1.8k
views
compiler-design
lexical-analysis
compiler-tokenization
0
votes
0
answers
16
Compiler design
Q1: Consider G :- $X \rightarrow X + Y | Y$ $Y \rightarrow Y*Z|Z$ $Z \rightarrow (X)$ $Z \rightarrow id$ if LR(1) parser is used to parse the above grammar, then total how many lookahead will be present in the dfa state I0 for the items $X \rightarrow .Y \text{ and } Z \rightarrow .id$ ... ------------------------------------------------------------ Someone verify all these answers.
Shubhanshu
asked
in
Compiler Design
Nov 8, 2018
by
Shubhanshu
607
views
compiler-design
parsing
syntax-directed-translation
basic-block-construction
compiler-tokenization
2
votes
2
answers
17
Number of Tokens
Na462
asked
in
Compiler Design
Nov 7, 2018
by
Na462
3.6k
views
compiler-design
compiler-tokenization
test-series
1
vote
2
answers
18
Lexical Analysis
How will the compiler detect whether "if" is a keyword or an identifier? Please tell me the concept behind this.
Lovejeet Singh
asked
in
Compiler Design
Nov 7, 2018
by
Lovejeet Singh
1.2k
views
compiler-design
lexical-analysis
compiler-tokenization
usergate2018
usermod
1
vote
3
answers
19
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
Balaji Jegan
asked
in
Compiler Design
Oct 23, 2018
by
Balaji Jegan
4.1k
views
tancet
compiler-design
lexical-analysis
compiler-tokenization
0
votes
1
answer
20
Fortran statement
The number of tokens in the fortran statements DO 10 I = 1.3 is ?
syncronizing
asked
in
Compiler Design
Sep 22, 2018
by
syncronizing
282
views
compiler-tokenization
0
votes
0
answers
21
tokens
Which of the following is not a token of c -program? A. 1.02e + 2 B. # define C. 123.33 D. MAX please explain why?
syncronizing
asked
in
Compiler Design
Sep 22, 2018
by
syncronizing
394
views
compiler-design
compiler-tokenization
0
votes
1
answer
22
number of tokens
Question: Find the number of tokens in the following C code using lexical analyzer of the compiler.
syncronizing
asked
in
Compiler Design
Sep 21, 2018
by
syncronizing
5.2k
views
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
1
vote
1
answer
23
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); }
sagar27
asked
in
Compiler Design
Sep 21, 2018
by
sagar27
5.2k
views
compiler-tokenization
lexical-analysis
1
vote
0
answers
24
Doubt in compiler
Whether a given pattern constitutes a token or not (a) depends on the source language (b) depends on the target language (c) depends on the compiler (d) none of the above comment is true
goluabhinan
asked
in
Compiler Design
Sep 16, 2018
by
goluabhinan
4.2k
views
compiler-design
compiler-tokenization
0
votes
1
answer
25
Printf("j=%d,&,j=%x",j&j)
Nageswara Rao G
asked
in
Compiler Design
Aug 22, 2018
by
Nageswara Rao G
933
views
compiler-design
lexical-analysis
compiler-tokenization
1
vote
1
answer
26
Token
No of token? $a b c d + y{^3}+(2-5+x$ $6/2$--;$ Please suggest how to count token in this type of questions?
Mayankprakash
asked
in
Compiler Design
Aug 9, 2018
by
Mayankprakash
490
views
compiler-design
compiler-tokenization
0
votes
2
answers
27
Number of tokens
In this question we will take n-=n1 as n=n-n1 as 5 tokens or n-=n1 as 4 tokens ????
saumya mishra
asked
in
Compiler Design
Jun 12, 2018
by
saumya mishra
2.2k
views
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
test-series
Page:
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent questions tagged compiler-tokenization
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation