GATE Computer Science (CS) 2017 Shift 1 Solved Paper
© examsiri.com
Question : 53 of 65
Marks:
+1,
-0
Consider the following grammar:
stmt → if expr then expr else expr; stmt | ȯ
expr → term relop term | term
term → id | number
id → a | b | c
number → [0 – 9]
where relop is a relational operator (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 flow paths in P is _______. For example. The program.
if e1 then e2 else e3
has 2 control flow paths, e1 → e2 and e1 → e3
stmt → if expr then expr else expr; stmt | ȯ
expr → term relop term | term
term → id | number
id → a | b | c
number → [0 – 9]
where relop is a relational operator (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 flow paths in P is _______. For example. The program.
if e1 then e2 else e3
has 2 control flow paths, e1 → e2 and e1 → e3
- Your Answer:
Go to Question: