What is an NP-complete problem?

What is the difference between a Static Single Assignments graph (SSAG) and a Control Flow Graph (CFG) which are used for the intermediate compiled sources representation in a compiler?

Which of the following is NOT a standard Common Lisp type testing predicate?

Which of the following is NOT a valid Common Lisp symbol name?

Which among the following is NOT a common element of parser internals?

What branching instructions type is more resource-consuming on the RISC processor?

What is the main advantage of using segregated lists usage in the manual memory management?

What is the optimal way of copying the contents of one array to another in C language?

Assume that two instructions L1 and L2 are dependent in a flow graph. What does it mean when one says that they are output-dependent?

Which of the following options is NOT a technique used in 'peephole optimization' of the generated code in a compiler?

What is the relationship between lexical and syntax analysis?