1. Define an EBNF grammar with the alphabet {a, b} thatdefines strings that start with an a, have one or more bsymbols and end with an a.2. Using each of the following grammars, draw a parse treefor 3 + 4 * 5.I. Expr -> Expr+ Term | Expr * Term | TermTerm →> 0 || 9II. Expr -> Term + Expr | Term * Expr | TermTerm -> 0 || 9III. Expr -> Expr + Term | TermTerm -> TermFactor - 0 |Factor | Factor| 93. Demonstrate that addition in C is not always associative(in the mathematical sense). The following twostatements should print significantly different results insome scenario. You need to figure out appropriate typesand values for a, b, and c. Can you do the same withmultiplication?printf("%f\n", (a + b) + c );printf("%f\n", a + (b + c) );

Answered: 1. Define an EBNF grammar with the…

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

Question

1. Define an EBNF grammar with the alphabet {a, b} that
defines strings that start with an a, have one or more b
symbols and end with an a.
2. Using each of the following grammars, draw a parse tree
for 3 + 4 * 5.
I. Expr -> Expr+ Term | Expr * Term | Term
Term →> 0 |
| 9
II. Expr -> Term + Expr | Term * Expr | Term
Term -> 0 |
| 9
III. Expr -> Expr + Term | Term
Term -> Term
Factor - 0 |
Factor | Factor
| 9
3. Demonstrate that addition in C is not always associative
(in the mathematical sense). The following two
statements should print significantly different results in
some scenario. You need to figure out appropriate types
and values for a, b, and c. Can you do the same with
multiplication?
printf("%f\n", (a + b) + c );
printf("%f\n", a + (b + c) );

Expert Solution

Step 1 Introduction

Extended Backus-Naur Form (EBNF) which refers to the one it is a family of metasyntax notations used to express a context-free grammar. It is used to define the syntax of a language, and can be considered a metalanguage as it is used to describe other languages. EBNF which uses a set of syntax rules to define the elements and structure of a language, and can be used to create parsers and compilers that can interpret and execute the language.

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

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