SNPVP [SUBCAT=nil]VP [SUBCAT= [HEAD=pp,TAIL=nil]]ARG [CAT=pp]he VP [SUBCAT=[HEAD=np,TAIL= [HEAD=pp,TAIL=nil]]] ARG [CAT=np]PPV [SUBCAT= [HEAD=np,TAIL=[HEAD=pp,TAIL=nil]]]NPgave: to his brotherthe bikeFigure 1: Graphical representation of the parse of he gave the bike to his brother.Note the two applications of VP[SUBCAT=?rest] -> VP [SUBCAT= [HEAD=?arg,TAIL=?rest]] ARG [CAT=?arg]. Also note the topmost VP has [SUBCAT=nil], whichis needed to apply the rule with left-hand side S.How the rules for subcategorisation are applied is illustrated in Figure 1. In order tohandle the verbs in our example sentences, further rules for V and ARG are needed, but itshould be possible to reuse the rule VP[SUBCAT=?rest] -> VP[SUBCAT= [HEAD=?arg,TAIL=?rest]] ARG[CAT=?arg] for several verbs, regardless of their subcategorisationframes.Step 4: final testingAgain test the positive and negative examples, and verify that all positive examplesare accepted, and none of the negative examples are accepted. You may add morepositive and negative examples (with words in the lexicon) to convince yourself thatyour grammar is satisfactory.RequirementsSubmit a zipped file containing:• P2. py (unmodified)• P2.fcfg (extended by you)... - 2

P2.fcfg S -> Sentence | WSentence | WQuestion Sentence -> NP[ARG=?arg] VP[ARG=?arg,SUBCAT=nil]…

Again test the positive and negative examples, and verify that all positive examples are accepted, and none of the negative examples are accepted. You may add more positive and negative examples (with words in the lexicon) to convince yourself that your grammar is satisfactory.

Again test the positive and negative examples, and verify that all positive examples are accepted, and none of the negative examples are accepted. You may add more positive and negative examples (with words in the lexicon) to convince yourself that your grammar is satisfactory.

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

Q: It's crucial to have a solid theoretical foundation that aids in understanding grammar vision for…

A: The Answer is in given below steps

Q: er possible to simplify the gramma t recursion from the grammars whe otes around any EBNF metasymbol

A: Summary EBNF (Extended Backus-Naur Form) is a type of formal grammar used to describe the syntax of…

Q: 1. Consider the following grammar and try to find out Operator Precedence and Associativity. Is the…

A: I have answered this question in step 2.

Q: Build a context-free grammar. Use the graphic notation to build the grammar that recognizes the…

A: java: IfThenElseContextFreeGrammar:: IfThenElseContextFreeGrammar:…

Q: NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to…

A: We are given a language and we are asked the correct set of productions for it. First we will try to…

Q: For each of the following languages, determine whether or not it is context-free. You must justify…

A: determine whether context free or not and pumping lemma or not in palindrome

Q: Write a grammar for Boolean expressions that includes the constants true and false, the operators…

A: Required Grammar mention below:

Q: Illustrate with example each of the following: a. A context free grammar for the strings that…

A: Answer - 1. A context-free grammar for the strings that consist of an equal number of a’s followed…

Q: From the grammar for an ILOC program, can we parse this grammar using a predictive top-down parser?…

A: The parsing technique is recursive as it uses context free grammar which means it is recursive in…

Q: Identify the productions of the phrase-structure grammar for each of these languages, where S is the…

A: Answer the above question are as follows

Q: NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to…

A: 10n ∣ n ≥ 0} (Check all that apply.) Check All That Apply A) S → 1A, A → 0A, and A → λ B) S →…

Q: Give a context-free grammar that generates the language { x in {a,b}* | the length of x is odd and…

A: CFG: CFG stands for context-free grammar. It is a formal grammar that is used to generate all…

Q: Show how a arbitrary regular expression can by systematically turned into a regular grammar. In…

A: Given: Show how a arbitrary regular expression can by systematically turned into a regular grammar.…

Q: Discuss about the different types of parsers ad different terms involved in the grammar symbols.

A: The second phase of a compiler is parsing or syntax analysis. The program that breaks the data…

Q: 1. Р (х, В, в) and P(A, y, z) 2. Q (Z, b) and Q(b, Y) 3. P (a, b, c) and Q(X, Y, z) 4. Р (X, а, X)…

A: Unification: It is a form of matching technique. In this one or more variables being given value to…

Q: Identify the productions of the phrase-structure grammar for each of these languages, where S is the…

A: We need to identify the productions of the phrase-structure grammar for given language, where S is…

Q: Discuss the validity of the following statements. a. An assignment operator like x += expr for some…

A: Answer a. This statement is valid. An assignment operator like x += expr is a shorthand for x = x +…

Q: See the image. a.Construct a context-free grammar generating C.Explain how your construction…

A: The answer for the above question is as follows

Q: What does ambiguity mean for a grammar? When do we say that a ammar is ambiguous? Please give an…

A: We are asked a question on ambiguity in grammars. First we will understand what ambiguity means and…

Q: For each statement below, decide whether it is true or false. If it is rue, prove it. If it is not…

A: Proved the given statement true or false

Q: Write a context-free grammar that accepts the language L = anbmck, n > 0, m > 1, k >= 0

A: a context-free grammar that accepts the language L = a^nb^mc^k, n > 0, m > 1, k >= 0

Q: Construct a PDA for the following grammar. E → E +T | T T → T × F | F F → (E) | a Note: First, you…

A: A pushdown automata for the given grammar

Q: 2:R(X), T2:R(Y), T2:W(X), T2:W(Y) ive two examples of schedules with T1 and T2: one with a WR…

A: Here in this question we have given a two transactions and we have asked to give two examples of…

Q: In order to better understand them, please provide an example of "Semantic augmentation" and a…

A: According to the information given:- We have to define Semantic augmentation with respect to CFG…

Q: The number must start with a left parenthesis, followed by 1or 2 digits, followed by a right…

A: Solution :- <phone> ::= <prefix> <middle> <suffix><prefix> ::= (…

Q: Find a grammar with a phrase structure for this language: the collection of bit strings that has an…

A: collection of bit strings that has an even number of 1s followed by a final 0.

Q: In the grammars shown below, upper case letters denote non-terminal symbols, lower case letters…

A: (a) The language generated by this grammar can be described as follows: 1) It consists of strings…

Q: 29. The language generated by the grammar S → aA | bB aD D aD | bD aA A → a bB А- B → a Will be…

A: The question is to choose correct option for the given problem

Q: For each statement below, decide whether it is true or false. If it is true, prove it. If it is not…

A: d) let's assume a FA which accept all the string which starts from a L1 is bbabaaba so it's is not…

Q: Design a Context-free grammar for the following language. L = {0*1$2* : i = 2k and i, j, k > 0}…

A: Context Free Grammar: A grammar contain a context free grammar then it must be a context free…

Q: Give a CFG for valid regular expressions over the alphabet Σ = {a,b}. The alphabet of your grammar…

A: A context-free grammar is a 4-tuple (V, T, P, S) where V - Set of non-terminals T - Set of…

Q: Rewrite the grammar below to put it in the form needed for a predictive parser. The lower case…

A: Here we design transition diagram of given rule and use predictive parser algorithm:…

Q: Find a phrase-structure grammar for this language: the set of bit strings consisting of an even…

A: Phrase-structure In linguistics and computer science, grammar is a formal way for describing a…

Q: Q. 16 Let G be the following grammar: S-XYfg X-XSm|e Y-XhS e Variables S, X and Y are non-terminals…

A: Introduction

Q: 2. Given Language with string that doesn't have ab in it with Σ = {a,b}, create regular grammar of…

A: Here, we are given a language and alphabet set. And we are asked to create a regular grammar for it.…

Q: Consider the following grammars where anything starting in a lowercase or special character…

A: Dear learner, hope you are doing well, I will try my best to answer this question. Thank You!!

Q: In order to better understand them, please provide an example of "Semantic augmentation" and a…

A: Required:For the CFG (Context Free Grammar) rules, describe "Semantic augmentation" and provide an…

Q: 5. Find a grammar for each language. a. The even palindromes over {a, b, c}. b. The odd palindromes…

A: Given : d.{anbcn | n belongs to N} Union {ambn | n,m belongs to N} e.{ambn | n,m belongs to…

Q: There are often many correct answers. a. The set of all strings consisting of zero or more as. b.…

A: Introduction BNF: A formal method of defining a languages and its grammar is the Backus-Naur Form…

Q: For each statement below, decide whether it is true or false. If it is true, prove it. If it is not…

A: Subset or equal to case in a language: All the strings that belongs to the left side language must…

Q: Write the prolog code of this DFA? and write 1. What is the starting state? 2. What is/are the…

A: You can think of Prolog as both a language for expressing code, and a language for expressing data.…

Q: In 3-5 sentences, find out the differences/similarities between if-else, else-if and nested if.

A: Difference/similarities between if-else , else -if and nested if

Q: Hello, I'm struggling to understand this problem and its elements. Would you mind providing a…

A: The objective of the question is to describe the language L(G) generated by the given grammar G in…

Q: another poposition statement that is equal to p-->(q v r) however by only including the connectives,…

A: Another proposition statement for the given statement

Q: L = {amb" | n 2 1, n = 2m}

A: Context free grammars are used to describe context free languages.

Concept explainers

Bare bones programming language

Bare bones programming language is a low-level programming language that gives a detailed stepwise description of a program. It has a tight program design and in-depth understanding of the toolchain. It is based on the target environment and is used for safe coding practices. C programming language is a type of bare bones programming language.

Question

100%

S
NP
VP [SUBCAT=nil]
VP [SUBCAT= [HEAD=pp,TAIL=nil]]
ARG [CAT=pp]
he VP [SUBCAT=[HEAD=np,TAIL= [HEAD=pp,TAIL=nil]]] ARG [CAT=np]
PP
V [SUBCAT= [HEAD=np,TAIL=[HEAD=pp,TAIL=nil]]]
NP
gave
: to his brother
the bike
Figure 1: Graphical representation of the parse of he gave the bike to his brother.
Note the two applications of VP[SUBCAT=?rest] -> VP [SUBCAT= [HEAD=?arg,
TAIL=?rest]] ARG [CAT=?arg]. Also note the topmost VP has [SUBCAT=nil], which
is needed to apply the rule with left-hand side S.
How the rules for subcategorisation are applied is illustrated in Figure 1. In order to
handle the verbs in our example sentences, further rules for V and ARG are needed, but it
should be possible to reuse the rule VP[SUBCAT=?rest] -> VP[SUBCAT= [HEAD=?arg,
TAIL=?rest]] ARG[CAT=?arg] for several verbs, regardless of their subcategorisation
frames.
Step 4: final testing
Again test the positive and negative examples, and verify that all positive examples
are accepted, and none of the negative examples are accepted. You may add more
positive and negative examples (with words in the lexicon) to convince yourself that
your grammar is satisfactory.
Requirements
Submit a zipped file containing:
• P2. py (unmodified)
• P2.fcfg (extended by you)
... - 2

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 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

NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Identify the productions of the phrase-structure grammar for each of these languages, where S is the starting symbol. The set of all strings containing 10 or more 0s and no 1s Multiple Choice A) S → A000000000, A → 0A, and A → λ B) S → 00000A000000 and A → λ C) S → 0000000000A, A → 0A, and A → λ
Write short note on semantic analysis phase and static checking
Find a phrase-structure grammar for this language: the set of bit strings that have neither two consecutive 0s nor two consecutive 1s. Please show all work and the thought process to get to the final answer.
6
Is so-called good grammar necessary in the English-speaking world today? If so, why? If not, why not?
Write a context free grammar generating the language: (0²1³40³41³ : p > 0,q>0}. Please check your solution by actually generating an example word from your grammar.
Please help to answer this short question Writing a grammar in practice is often quite different than writing one in EBNF format, because real-world grammar generators have their own complex rules. Can accept identifiers and numbers (with scientific notation)? Can accept multiplication, division, addition, subtraction, modulus, and parentheses? Once grammar is completed, could you describe how this grammar work?
True or False, please have some explanation 1. A derivation is a way of showing that a specific grammar produces a specific string.
Could you Please Choose the correct answer without explanation ..Thank you
Can i use "was won" in a sentence? And is it a correct grammar? For example, The Academy Award for best animated film was won by WALL-E.
1. Use the algorithm described in class that takes a CFG and converts it into a CNF (Chomsky Normal Form) grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: SAB AB →bAa A → aaB bb
For this exercise, we will work on a regular grammar to recognize a comment in a C++ or Java program. A comment starts with /* and ends with */ and anything else in between can be ignored. We won't consider the case of nested comments. Keep in mind that you can have any number of * characters at the beginning, at the end, and in between. • Write a regular grammar recognizing such comments. • Draw the finite state machine for this grammar. • Draw a table for this grammar such as the ones for table-driver scanners in the class notes and in the book.