There was a problem sending you an sms. Check your phone number or try again later.
We've sent a link to the Scribd app. If you didn't receive it, try again.
First Sessional Test (2007-2008)
B.Tech V Semester (CS)
Compiler Design (TCS 502)
Explain bootstrapping in detail. Suppose you have a working C compiler on machine A. Discuss the steps with T-diagram you would take to create a working compiler for another language C\u2019 on machine B.
Q.2) For the grammar G-
S -> A
A -> aB/aC/Ad/Ae
C -> g
E\ue000 T+E/T T\ue000 V*T/V V\ue000 id
(a)Show how the string aa+a* can be generated by this grammar.
(b)Construct a parse tree for this string.
(c) What language is generated by this grammar? Justify your answer.
First Sessional Test (2005-06)
Subject: Compiler Construction (CS-604)
Class: B.Tech (CS) VI Sem
Q.2) What do you understand by token? Construct transition diagram to recognize the while, if, else, <, <=, >, >= tokens. And also explain how the input read by the lexical analyzer.
Q.3) Explain bootstrapping in detail. Suppose we have a C compiler on machine A construct a Pascal compiler for machine A and B.
Now bringing you back...
Does that email address look wrong? Try again with a different email.