Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Consider the following grammar for a declaration list: decl_list decl ; decl_list | decl specifier type name_list specifier const | static | type double |

Consider the following grammar for a declaration list:

decl_list decl ; decl_list |

decl specifier type name_list

specifier const | static |

type double | int

name_list name | name , name_list

name id args

args ( decl_list ) |

(a) (4 pts) Indicate whether each of the following strings belongs to the language described by the grammar. int a (int b); int c (int d (int e;);); double f, g (static int h;); static int i; const double j;

(b) (7 pts) Show a leftmost derivation of the string static int f(); under this grammar.

(c) (10 pts) Rewrite the grammar so that arguments are separated by commas (similar to the function arguments in C). For instance, each of the following should be a valid string under the new grammar: int f (); int f (double x); int f (double x, int y);

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Handbook Of Relational Database Design

Authors: Candace C. Fleming, Barbara Von Halle

1st Edition

0201114348, 978-0201114348

More Books

Students also viewed these Databases questions

Question

b. What are its goals and objectives?

Answered: 1 week ago