Register

Geeks for geeks gate 2016 mock

2,191 views
4 votes
4 votes
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
User Avatar

2 Answers

Best answer
4 votes
4 votes
Lexical Analysis deals with lexems and the length of an identifier is not defined in the programming languages mostly... i.e as such there is no constraint on the length of the identifiers so In the Lexical Analysis, regular expression can be used to model the structure of lexemes with variable length identifier included.

So option d
• selected by
User Avatar
0 votes
0 votes
option D)the structure of lexemes with variable length identifier included.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.9k
views
6 answers
4 votes
admin asked Mar 31, 2020
1,946 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is:A set of regular expressionsStrings of characterSyntax treeSet of tokens
User Avatar
4.4k
views
3 answers
1 votes
Balaji Jegan asked Oct 23, 2018
4,406 views
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 ... is true $S_{1}$ is falseBoth $S_{1}$ and $S_{2}$ are false
User Avatar
2.5k
views
2 answers
8 votes
shikharV asked Nov 22, 2015
2,494 views
CFG for lexical analysis
A context free grammar can be used to model the lexical concerns of a HLL. This is not normally done and a regular grammar is used for the structure of ... ) There is a separation of concerns which controls complexity.(D) All of the above
User Avatar
712
views
1 answers
3 votes
GO Classes asked Jan 13
712 views
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\}.$ ... outputs the token that matches the longest possible prefix.Rule$1$Rule$2$Rule$3$Rule$4$
User Avatar
Link Copied!