Uncategorized

Analyse and evaluate moral and ethical considerations in specific security and privacy issues while transitioning to new technologies.

1.       What are deterministic finite machines and non-deterministic finite machines? List out the differences between them. 2.       How do you translate a regular expression to an NFA? Translate (a|b|c)?d into an NFA and draw its transition diagram. 3.       Write an algorithm to interpret an NFA and report if a given string matches the NFA. Illustrate

1.       How do SLR(1), LR(1) and LALR(1) methods compare against each other in the process of constructing the parsing table from the grammar? Draw a set diagram depicting the applicability of SLR(1), LR(1) and LALR(1) methods on the grammars. 2.       How does the error detection and error recovery happen in LR parsing? Illustrate with an

1.       What is semantic analysis? Give some examples of errors that are detected during semantic analysis. 2.       What are the main tasks involved in semantic analysis? How is it different from syntax analysis? Illustrate with an example. 3.       Explain the terms:   (a) decorated parse tree,   (b) dependency graph,   (c) inherited and synthesised attributes. Illustrate with

1.       A semantic analyser strips out the comments and white spaces from input source program. 2.       Semantic analysis involves verifying if the input source forms a legal set of instructions in accordance with the language rules. 3.       A semantic analyser checks if all the variables are declared before use. 4.       A semantic analyser checks if

1.       What kinds of syntax directed definitions are suited for evaluation of semantic rules during the parsing? Explain with an example. 2.       What is a translation scheme? How is it different from a syntax-directed definition? Illustrate the order of execution of semantic actions in a translation scheme? 3.       How do we evaluate synthesised and inherited

How do we construct a top-down parser that can evaluate semantic rules during the parsing for an L-attributed definition? Illustrate with an example. Describe the parse tree method of evaluating semantic rules. What are its limitations? How do we evaluate semantic rules using the rule-based method? Describe a recursive evaluator with an example. How do

1.       What is a symbol table? Explain how the symbol table in a compiler can be implemented by a hash table. 2.       Explain some of the productions and the semantic actions pertaining to the processing of the declarations in a semantic analyser for C language. 3.       Explain static and dynamic type checking with examples 4.      

1.       What is name equivalence? In what context is name equivalence used during the type checking? Illustrate with an example in C language. 2.       Write an algorithm to check the equivalence of two type expressions in C language represented by a linked list. 3.       Explain some of the productions and the semantic actions pertaining to

A compiler can choose one of the two options (a) Translate the input source into intermediate code and then convert it to final machine code; (b) Directly generate the final machine code from the input source. What is the preferred option and why? Describe the three address code form of the intermediate code. List out