Q53 Consider the following grammar gate computer science 2017

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions

GATE-Computer-Science-Engineering-2017-->View question

Q.53) Consider the following grammar: -gate computer science 2017

stmt  -> if expr then else expr; stmt | ε
expr -> term relop term | term
term -> id | number
id ->  a | b | c
number -> [0-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


Taged users:

Be first to like this question

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

You may also like our videos

Below are some of the videos from our collection. We saw that students not only needed content but also videos. So, we decided to build a video platform for you also an algorithm which shows best videos suites to you related to the content you are browsing check out some videos which suit best for you.


B) 1024

Number of control flow paths for 10 if terminals
if then else ; stmt
if then else ; if then else ; stmt
10 times. Observe that there is a semi-colon after every if structure. Since, every if structure has 2 control flows. Therefore, 1st terminal has 2 control flows, 2nd terminal has 2 control flows, 3rd terminal has 2 control flows, ........... 9th terminal has 2 control flows, and 10th terminal has 2 control flows. Using multiplication law of counting, we get = 2*2*2*2*2......10 times = 2^10 = 1024 number of control flow paths for 10 if terminals. 1024 is correct answer.

This explanation is contributed by Deepak Raj


Be first to like this answer

Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.
Career: Work or do your internship with us.
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.
Donate: Ad revenue alone is not able to take care of our server cost consider donating at least a dollar Click here to donate.

If you want the help of doing any of these never hesitate to drop an email to me arunwebber[at]gmail[dot]com, Or you can ping us on WhatsApp ph: 8147433408

Can you help us to add better answer here? Please see this

Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!