Refer to this grammar that resembles the syntax for a simple English declarative sentence: N ={IC, NPH, NOUNHEAD, ADJPH, PREPPH, VPH} T ={det, noun, pronoun, adj, prep, aux, verb} /* Independent Clause or Sentence */ IC → NPH VPH NPH → noun PREPPH | det NOUNHEAD PREPPH | pronoun | noun | det NOUNHEAD NOUNHEAD →→ ADJPH noun | noun ADJPH → adj PREPPH prep NPH VPH → aux verb COMPLEMENT | aux COMPLEMENT | aux verb | aux COMPLEMENT → PREPPH | NPH Given a lexicon (a Dictionary) for the following: noun = {boy, girl, boys, girls, chair, chairs, desk, desks, rainbow} pronoun {he, she,they, I} verb = {run, ran, running, fell, fall, falling, jump, jumps, jumping, sit, sits, sat, sitting} adj = {tall, dark, short, light, soft, hard} det = {a, an, the} aux = {is, are} prep = {of, on, in, to, over) Modify the grammar to allow for all three of the following language features: a. Compound Noun Phrases. e.g., "The boy and the girl" b. Compound Verb Phrases, e.g., "Are running and jumping over the rainbow" c. Compound Sentences, e.g., "The boys are running and the girls are jumping" for T, add the terminal symbol conj with dictionary entries = {and,or}

Refer to this grammar that resembles the syntax for a simple English declarative sentence: N ={IC, NPH, NOUNHEAD, ADJPH, PREPPH, VPH} T ={det, noun, pronoun, adj, prep, aux, verb} /* Independent Clause or Sentence */ IC → NPH VPH NPH → noun PREPPH | det NOUNHEAD PREPPH | pronoun | noun | det NOUNHEAD NOUNHEAD →→ ADJPH noun | noun ADJPH → adj PREPPH prep NPH VPH → aux verb COMPLEMENT | aux COMPLEMENT | aux verb | aux COMPLEMENT → PREPPH | NPH Given a lexicon (a Dictionary) for the following: noun = {boy, girl, boys, girls, chair, chairs, desk, desks, rainbow} pronoun {he, she,they, I} verb = {run, ran, running, fell, fall, falling, jump, jumps, jumping, sit, sits, sat, sitting} adj = {tall, dark, short, light, soft, hard} det = {a, an, the} aux = {is, are} prep = {of, on, in, to, over) Modify the grammar to allow for all three of the following language features: a. Compound Noun Phrases. e.g., "The boy and the girl" b. Compound Verb Phrases, e.g., "Are running and jumping over the rainbow" c. Compound Sentences, e.g., "The boys are running and the girls are jumping" for T, add the terminal symbol conj with dictionary entries = {and,or}

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

Topic: Concepts of programming Language Perform the pairwise disjointness test for the following grammar rules. (please give a few details)i. S → aSb|bAAii. A → b{aB}|biii. B → aB|bA
arrow_forward Step 1 Context Free Grammar: A formal language that is used to generate all possible strings in a given formal language is called context free grammar. It can be defined as: G=(V, T, P, S) Where G specifies the grammar V specifies the finite set of non-terminal symbols. T specifies the finite set of terminal symbols. P specifies the set of production rules. S specifies the start symbol. The start symbol S is used to derive a string in a context free grammar. It is derived by repeatedly replacing a non-terminal symbol by the right-hand-side production until all the non-terminal symbols have been replaced by the terminal symbols. arrow_forward Step 2 G is a context-free grammar for a language L, and L contains only strings of length 2 or greater. We have to prove that there is a context-free grammar Gd which generates L such that every rule in Gd has the form A -> x1x2, where A is a terminal and each xi is a terminal or a non-terminal. Let the alphabet of…
S -> aSa | aXa X ->aXa | bYb Y -> bYb | empty where S is the start symbol, non-terminals = {S, X, Y}, terminals = {a, b} Convert this grammar to Chomsky Normal Form. Show the steps in this conversion.
Build a context-free grammar. Use the usual notation to build the grammar that recognizes the FOR loop in the java and python languages. Please Explain
Given the grammar: E-> E + E|E*E| num Which of the following is true? O The grammar is unambiguous O The grammar enforces correct associativity O The grammar enforces correct precedence O The grammar is left recursive
Question 2: The following context-free grammar describes part of the syntax of a simple programming language. Non-terminals are given in capitals and terminals in lower case. VAR represents a variable name and CONST represents a constant. The productions for ASSN-STMT are not given, as they do not affect the question. 1 PROGRAM → Procedure STMT-LIST 2 STMT-LIST → STMT STMT-LIST 3 | STMT 4 STMT → do VAR = CONST to CONST { STMT-LIST } 5 | ASSN-STMT Q) Create attribute(s) and add semantic functions to the above grammar. Write them beside the productions above.
Backus Naur Form (BNF) is a standard notation for expressing syntax as a set of grammar rules. Figure 1 below shows a grammar for assignment with arithmetic operations, e.g. y = (2*x + 5)*x - 7; assignment => ID = expression ; expression => expression + term I expression - term I term term term * factor | term / factor | factor ( expression ) | ID | NUMBER factor => Figure 1. Grammar (a) Identify and list all the non-terminal symbols in the grammar (b) Identify and list all the terminal symbols in the grammar
1. Find a context free grammar that generates each of the following languages: 1. L= {0™1" |m=n} 2. L= {0™1" | m+ n} 2. Construct a context-free grammar that generates all regular expression over the al- phabet {a, b}
Computer Science alphabet = {0,1}^* Construct a Context Free Grammar for the language. w is a string with exactly one 0 which is not in the middle of the string.
Q1: Compute the weakest precondition for each of the following assignment statements and postconditions: a) a=2* (b - 1) -1 {a > 0} b) b=(c+10)/3 {b>6} c) a=a+2*b-1 {a > 1} d) x=2* y+ x -1 {x > 11} Q2: Using the grammar, show a parse tree and a leftmost derivation for each of the following statements: → → A| BI C → + | |( ) 1. a. A = A * (B + (C * A)) b. B C* (A * C+ B) с. А - А * (В + (C))
Note:- any wrong Answer will downvote Construct a DFA accepting the language: {W€{a, b}*: W has neither aa nor bb as a substring}
Complete the following context free grammar for the following language. Please ASAP