Recent questions tagged compiler-design

0 votes
0 answers
272
we know that a + *b there is no semantic error but a + /b is a syntax error or semantic error?
1 votes
0 answers
273
0 votes
0 answers
274
float a =10 is not a semantic error but in the semantic phase int a =10.0 will be a semantic error or not bcz compiler cannot do explicit type conversion..so it must be a...
1 votes
0 answers
275
int 7=10;It is a semantic error or syntax error?My thinking is that it can be tokenized as id id = id ;….So it is valid statement...so it must be semantic error?Correct...
0 votes
0 answers
276
Assembler,Linker,Macros are there in compiler design?
1 votes
1 answer
278
Natural language constructs are(A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
0 votes
2 answers
279
0 votes
1 answer
280
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of ...
1 votes
4 answers
281
Every unambiguous grammar is LR(0) grammar?
0 votes
2 answers
282
If the grammar has only S-attributed semantic definitions, in a top down parser we will add the semantic action at the end of production and it will we executed when we...
1 votes
2 answers
283
0 votes
0 answers
284
How Directed acyclic graph would be constructed for this instruction?b[j] = a ;
1 votes
1 answer
287
According to the solution, there is no error in the program. And I ran the program there is no error. But how the rank is declared as int and initialized by 10.3 which is...
1 votes
1 answer
288
3 votes
1 answer
290
Design predictive parsing table for below grammar.How many multiple entries are there?S → AA | abA → Bd | εB → SB | d
3 votes
1 answer
292
State whether the following statements are True or False with reasons for your answer:A two pass assembler uses its machine opcode table in the first pass of assembly.
5 votes
1 answer
293
21 votes
7 answers
294
9 votes
4 answers
295
8 votes
1 answer
298
Consider the following augmented grammar with $\{ \#, @, <, >, a, b, c \}$ as the set of terminals. $$\begin{array}{l} S’ \rightarrow S \\ S \rightarrow S \# cS \\ S \r...