Q. 53 Consider the following grammar:
stmt -> if expr then else expr; stmt | ε expr -> term relop term | term term -> id | number id -> a | b | c number -> [-9]
where relop is a relational operate (e.g < >, ….), ε refers to the empty statement, and if
,then, else are terminals.
Consider a program P following the above grammar containing ten if terminals. The number
of control flows paths in P is ____________.
For example, the program
if e1 then e2 else e3
has 2 control flow paths, e1 -> e2 and e1 -> e3
(A) 20
(B) 1024
(C) 2048
(D) 10
Answer: (B)
Explanation:
