Using the grammars, draw trees for the expressions given, then answer the questions. There are tools available for drawing trees, but you may simply draw them by hand, as long as they are neat. Then scan them into a single document and upload in Canvas. Grammar 1 Grammar 2 Grammar 3 → - | → / | → ()| →A | B | C → - | → / | → ()| → A | B | C → / | → - | → ()| → A |B | C 1. Derive parse trees for the expression A-B/C a. using Grammar 1 b. using Grammar 2 C. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why? 2. Derive parse trees for the expression A-B-C a. using Grammar 1 b. using Grammar 2 c. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why? 3. Derive parse trees for the expression (A-B)/C a. using Grammar 1 b. using Grammar 2 c. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why?

Using the grammars, draw trees for the expressions given, then answer the questions. There are tools available for drawing trees, but you may simply draw them by hand, as long as they are neat. Then scan them into a single document and upload in Canvas. Grammar 1 Grammar 2 Grammar 3 → - | → / | → ()| →A | B | C → - | → / | → ()| → A | B | C → / | → - | → ()| → A |B | C 1. Derive parse trees for the expression A-B/C a. using Grammar 1 b. using Grammar 2 C. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why? 2. Derive parse trees for the expression A-B-C a. using Grammar 1 b. using Grammar 2 c. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why? 3. Derive parse trees for the expression (A-B)/C a. using Grammar 1 b. using Grammar 2 c. using Grammar 3 Are any of these parse trees 'better' than any of the others for this expression? Why?

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

Similar questions

Create a context free grammar for each of the followinglanguages.a. L = { a i b j | i < j }b. L = { a i b j ck d l | 0 < j < i, 0 < l < k }c. L = { a i b j ck d l | i = l, j < k }
M09. .
Topic: Concept of Programming Language Is aacccdcc in the language generated by the followinggrammar? If so, draw the parse tree. If not, show why. <S> → a <S> c <B> | <A> | b<A> → c <A> | c<B> → d | <A>
Create a grammar for this DFA. The green state A3 is the final state and S is the start symbol.
Is this context free grammar? and why? L = { : k>=1}
Context-free grammars are sometimes used to model natural languages. In this problem you will model a fragment of the English language using context-free grammars. Consider the following English sentences: The girl is pretty. The girl that the boy likes is pretty. The girl that the boy that the clerk pushed likes is pretty. The girl that the boy that the clerk that the girl knows pushed likes is pretty. This is a special type of sentence built from a subject (The girl), a relative pronoun (that) followed by another sentence, a verb (is) and an adjective (pretty). Give a context-free grammar G that models this special type of sentence. Your terminals should be words or sequences of words like pretty or the girl. Is the language of G regular? If so, write a regular expression for it. If not, prove using the pumping lemma for regular languages. Can you give an example of a sentence that is in G but does not make sense in common English?
What language does the following grammar accept? S -> ABC A -> aA A -> a B -> bBb B -> bb C -> cCd C -> cd {Please solve}
Exercise 2: The following shows a simple context free grammar (CFG) : Exercise 3: Consider the following grammar : Which of the following sentences are recognized by this grammar: 5+9+5, 2+8*(4*9)*4*(7+6), 3+7-2 S T E →>> T→> F→ ab (T) T,S | S E+T T T*F F nb (E) a) What is the type of this grammar ? b) Give the four elements of this grammar {T,N,S,P} c) Draw the parse tree for: (a,b) and (b,(a,a))
Compilation Techniques Given RE as follows: (ab | b*) a*b Asked:a. Make a complete syntax tree with firstPos and lastPosb. Make the DFA and draw the result
Write a BNF grammar describing the syntax of BNF; i.e., define the syntax of BNF itself using BNF. Use a pair of single quotes to use meta symbols like | and -> as terminal symbols, e.g., '|' and '->'. You may assume that non-terminals such as <identifier> and <special-symbol> are already defined.
Subject Name Theory