Backus Naur Formalism

Posted: July 5, 2011 in Graduate School, Programming Languages
0

This entry is in response to the online assignment in our Graduate School for BNF

Consider the following BNF grammar rules:

Which of the following strings can be derived from the grammar given above? THE ANSWER IS: STRINGS 1, 2, 4, & 5 CAN BE DERIVED. Below are the derivations:

Advertisement

Leave a Reply

Fill in your details below or click an icon to log in:

Gravatar
WordPress.com Logo

You are commenting using your WordPress.com account. ( Log Out / Change )

Twitter picture

You are commenting using your Twitter account. ( Log Out / Change )

Facebook photo

You are commenting using your Facebook account. ( Log Out / Change )

Cancel

Connecting to %s