Register

IISC-CSA-Research-Test-2

295 views

1 Answer

Best answer
1 votes
1 votes
lexical analyser..type checker is semantic analyser which comes at 3rd step in the flow of compilation.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
2
go_editor asked Jun 8, 2016
473 views
IISC-CSA-Research-Test-9
Which of the following statement(s) is(are) true? If $n$ is odd prime number then $2^{n-1} \text{ mod } n =1$ If $2^{n-1} \text{ mod } n =1$ for a number $n$ then $n$ is prime
Which of the following statement(s) is(are) true?If $n$ is odd prime number then $2^{n-1} \text{ mod } n =1$If $2^{n-1} \text{ mod } n =1$ for a number $n$ then $n$ is pr...
User Avatar
2 votes
2 votes
1 answer
3
go_editor asked Jun 8, 2016
346 views
IISC-CSA-Research-Test-8
Write the truth table for the connective: "If A then B"
Write the truth table for the connective: "If A then B"
User Avatar
0 votes
0 votes
3 answers
4
go_editor asked Jun 8, 2016
679 views
IISC-CSA-Research-Test-6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? I...
User Avatar
Link Copied!