Hello learners In this article we are going to discuss NPTEL Compiler Design Assignment 3 Answers. All the Answers provided below to help the students as a reference, You must submit your assignment with your own knowledge and use this article as reference only.
About the course:-
Compilers have become part and parcel of today’s computer systems. They are responsible for making the user’s computing requirements, specified as a piece of program, understandable to the underlying machine. There tools work as interface between the entities of two different domains – the human being and the machine. The actual process involved in this transformation is quite complex.
NPTEL Compiler Design Assignment 3 Answers 2024:
1. Which of the following Machine model is usually used (at least implicitly) for parsing of strings?
Answer :- Will update answers soon and update on our telegram channel so Join Click Here
2. A context free grammar (CFG) is treated as ambiguous when there exists a string in the language of the grammar which:
Answer :-
3. What is the language of the following finite automaton?
Answer :-
4. What is the language of the following finite automaton?
Answer :-
5. What is the language of the following finite automaton?
Answer :-
6. What is the shortest string that is not a member of the language represented by the regular expression a*(ab)*b* (shortest in length)?
Answer :-
7. Given L={anbm| n, m > 0}, we define L’={wwR|w is a string of L}. Which of the following is true?
Answer :-
8. Which of the following grammars accepts strings over the alphabet set {a, b}, such that every a is immediately followed by one b?
Answer :-
9. Consider the grammar: S → aSa|bSb|a|b. The language generated by the above grammar is:
Answer :-
10. Consider the grammar given below with variable set {S, L} and the terminals {(, ), a, ,}.
S –> (L) | a
L –> L, S | S
Which of the following strings will be accepted by the grammar?
Answer :-
11. A parse tree shows which of the following properties?
Answer :-
12. In which phase of the compilation process, parse tree is generated?
Answer :-
