Make the following grammar suitable for predictive parsing table construction:

B → asA | asX  | b

A → Aa | AXb | c

X → b

Which of the following concept(s) are used in Top-Down Parsers?

Which of the following is not true about LR parsers?

__________________ is a loop optimization technique where two or more adjacent loops with the same iteration space are combined into a single loop to reduce loop overhead and improve data locality.

Consider the following code snippet:

if(a>b) {a=b+c;} else{b=a+c;}

Apply backpatching to determine the addresses for the labels (as per the order of instructions) in the corresponding Three-Address Code (TAC). 

Note:

• Do not store the relational expression in a temporary variable.

• Assume that instruction addresses start from 0.

Find the lastpos of the first concatenation (dot) node from bottom to top in the syntax tree for the regular expression:

aa* b | a b*

Find the action in the entry [0, id] of the SLR Parsing Table for the following CFG

In bottom-up parsers, which of the following conflicts can occur while constructing the LR parsing tables?

A. Shift–Reduce Conflicts

If a variable x is defined in a Basic Block B1 and its value is not used again until after it is redefined in a subsequent block B2, how is the definition of x in B1 classified?

Which of the following global dataflow analysis helps remove common subexpression elimination? (Choose the most optimal one)