Register

UPPCL AE 2018:27

• edited by
253 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
admin asked Jan 5, 2019
274 views
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
User Avatar
1 votes
1 votes
0 answers
2
admin asked Jan 5, 2019
261 views
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...
User Avatar
0 votes
0 votes
1 answer
4
admin asked Jan 5, 2019
365 views
UPPCL AE 2018:64
The following grammar $\text{G}$ is left recursive. $\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $ $\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $ $\text{F} \rightarrow \text{(E)} \mid \textbf{id} $ Which of the following is a ...
The following grammar $\text{G}$ is left recursive.$\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $$\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $$\text{F...
User Avatar
Link Copied!