Dark Mode

Recent questions tagged lexical-analysis

0 votes

2 answers

1

Compiler Design | Error in which stage detection
What is the earliest stage compiler error for the following C code snippet: int x = @33; Lexical Error Syntax Error Semantic Error None

Souvik33 asked in Compiler Design Jan 13

155 views

0 votes

0 answers

2

Best Open Video Playlist for Lexical Analysis Topic | Compiler Design
Please list out the best free available video playlist for Lexical Analysis Topic from Compiler Design as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Others Aug 18, 2022

by makhdoom ghaya

93 views

0 votes

2 answers

3

lexical and syntax error
what is the difference between lexical error and syntax error?

Mohit Aggarwal asked in Compiler Design Dec 1, 2021

by Mohit Aggarwal

745 views

2 votes

1 answer

4

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

179 views

3 votes

6 answers

5

NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is: A set of regular expressions Strings of character Syntax tree Set of tokens

Lakshman Patel RJIT asked in Compiler Design Mar 31, 2020

by Lakshman Patel RJIT

1.1k views

2 votes

5 answers

6

NIELIT 2017 July Scientist B (CS) - Section B: 49
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis

Lakshman Patel RJIT asked in Compiler Design Mar 30, 2020

by Lakshman Patel RJIT

1.1k views

2 votes

8 answers

7

UGC NET CSE | January 2017 | Part 2 | Question: 33
Consider the following statements related to compiler construction: Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? Only I Only II Both I and II Neither I nor II

go_editor asked in Compiler Design Mar 24, 2020

2.0k views

0 votes

2 answers

8

TIFR CSE 2020 | Part B | Question: 9
A particular Panini-Backus-Naur Form definition for a $<\textsf{word}>$ is given by the following rules: $<\textsf{word}>:: = \:<\text{letter}> \mid <\text{letter}>\:<\text{pairlet}>\mid <\text{letter}>\:<\text{pairdig}>$ ... $\text{III}$ only $\text{II}$ and $\text{III}$ only $\text{I},\text{II}$ and $\text{III}$

Lakshman Patel RJIT asked in Compiler Design Feb 11, 2020

by Lakshman Patel RJIT

652 views

3 votes

0 answers

9

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 Patel RJIT asked in Compiler Design Aug 5, 2019

by Lakshman Patel RJIT

842 views

0 votes

1 answer

10

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 Patel RJIT asked in Compiler Design Jul 27, 2019

by Lakshman Patel RJIT

728 views

0 votes

0 answers

11

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 Patel RJIT asked in Compiler Design Jul 27, 2019

by Lakshman Patel RJIT

928 views

3 votes

1 answer

12

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.4k views

2 votes

2 answers

13

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

3.0k views

1 vote

2 answers

14

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

1.7k views

0 votes

3 answers

15

Error during compilation
fro(int I=0; I <5;I++); what kind of compilation error is this ?

VJ2793 asked in Compiler Design Feb 12, 2019

by VJ2793

396 views

2 votes

3 answers

16

Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?

kman30 asked in Compiler Design Jan 21, 2019

by kman30

1.1k views

0 votes

2 answers

17

Compiler Design
Type of ERROR

balchandar reddy san asked in Compiler Design Jan 19, 2019

by balchandar reddy san

687 views

0 votes

1 answer

18

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...

Prasad Budithi asked in Compiler Design Jan 16, 2019

by Prasad Budithi

3.0k views

1 vote

0 answers

19

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

Lakshman Patel RJIT asked in Compiler Design Jan 5, 2019

by Lakshman Patel RJIT

153 views

1 vote

0 answers

20

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

Lakshman Patel RJIT asked in Compiler Design Jan 5, 2019

by Lakshman Patel RJIT

131 views

1 vote

0 answers

21

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

Lakshman Patel RJIT asked in Compiler Design Jan 5, 2019

by Lakshman Patel RJIT

143 views

3 votes

2 answers

22

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

Prince Sindhiya asked in Compiler Design Dec 27, 2018

by Prince Sindhiya

1.8k views

0 votes

1 answer

23

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

282 views

Page:

1
2
3
4
5
next »

Recent questions tagged lexical-analysis