Gate2017 cs Q52

0. Consider the following grammar:
stmt → if exp r then else exp r ;stmt 0
exp r → termrelop term term
term → id | number
if → a | b | c
number → [0...9]
where relop is a relational operate (e.g <, >,...) ---O 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 e₁ then e₂ else e₃
has 2 controls flow paths e₁→ e₂ and e₁ → e₃

Answer
Comment
Array

Option : C
Explanation :
For 2 “if statements”, 22 = 4 control flow paths are possible:

So for 10 “If statements”, control flow paths will be there.

Forgot your password?

I agree with the Terms.