Answered: Consider a CFL for Java if-statements:…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Consider a CFL for Java if-statements:
G = ({<STMT>, <IF-THEN>, <IF-THEN-ELSE>}, {if, condition, else, (, ), stmt}, R, <STMT>)
where R is:
<STMT> → stmt | <IF-THEN> | <IF-THEN-ELSE>
<IF-THEN> → if ( condition ) <STMT>
<IF-THEN-ELSE> → if ( condition ) <STMT> else <STMT>
Show that G is ambiguous and give a different, unambiguous grammar for the same language that corresponds to Java semantics.

Expert Solution

Step 1

Given grammar G = ({<STMT>, <IF-THEN>, <IF-THEN-ELSE>}, {if, condition, else, (, ), stmt}, R, <STMT>)
where R is:
<STMT> → stmt | <IF-THEN> | <IF-THEN-ELSE>
<IF-THEN> → if ( condition ) <STMT>
<IF-THEN-ELSE> → if ( condition ) <STMT> else <STMT>

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions