Consider the context-free grammar S' → A$ A→ aA | B|A B → bB | CA In each of the following questions list your set in alphabetical order with $ at the end of the list if it's included. If a set is empty write exactly the word empty. Separate items using commas and no spaces. For example: x,y,$ What is in First(S')? { What is in First(A)? { } What is in First(B)? { } What is in Follow(S')? { What is in Follow(A)? { } What is in Follow(B)? {

Consider the context-free grammar S' → A$ A→ aA | B|A B → bB | CA In each of the following questions list your set in alphabetical order with $ at the end of the list if it's included. If a set is empty write exactly the word empty. Separate items using commas and no spaces. For example: x,y,$ What is in First(S')? { What is in First(A)? { } What is in First(B)? { } What is in Follow(S')? { What is in Follow(A)? { } What is in Follow(B)? {

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

C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
Let L1, L2, and L3 be languages over some alphabet. In each case below, two languages are given. Say what the relationship is between them. (Are they always equal? If not, is one always a subset of the other?) Give reasons for your answers, including counterexamples if appropriate. 1. L1(L20L3), L1L20LL3 2. LinL;, (L nL2)*
Define a Prolog predicate project/3 that selects elements from a list by their position and collects them in a result list. For example, the goal of project( [2,4],[a,b,c,d],L) should produce the answer L=[b,d]. You can assume that the numbers in the first list are strictly increasing, that is, your implementation does not have to care about situations like project([1,1,2],..) or project([2,5,3],.).
Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…
Consider the context-free grammar S- A$ A→ aAa | B B → bbB | A In each of the following questions list your set in alphabetical order with $ at the end of the list if it's included. Separate items using commas and no spaces. For example: x,y,$. If a set is empty write "empty". What is in First(S)? { What is in First(A)? { } What is in First(B)? { } What is in Follow(S)? { What is in Follow(A)? { } What is in Follow(B)? { }
Convert the grammar into Greibach normal form. In addition, please show what you did to get the answer on paper or by typing it. Grammar:S →aSb | ab | bb
Please translate the following English sentence into a sentence of FOL: use quantifiers "Lucia owns exactly one guitar" Domain: people and things M(x): x is a musician G(x):x is a guitar player R(x): x is a guitar O(x,y): x owns y L: lucia
Consider the language L of strings over the alphabet Σ = {a, b} which contain an equal number of a’s and b’s, and the set of b’s is consecutive in the string, e.g., ab, abba, aabb, abbbaa, aaabbbbbaa, etc. Note that ε ∈ L for completeness (0 number of a’s is equal to 0 number of b’s, which are also consecutive). Show that this language is context-free by giving a context-free grammar. Please make sure to test the answers onhttps://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/
Construct a CFG and PDA for the language B={w| w is a string over {a,b} with the same count of a's and b's}. For example, abba € B, abab e B,aabb € B, babbbaaaba € B, that is, there is no particular order in which a's and b's appear in w as long as there is the same amount of them.
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?
Given the following EBNF grammar: A -> [B, C,] D B-> '(, E, F, '), E C-> ', G D->-, G E -> " " F-> "o", "D", G-> "I" Give an example sentence that is within the grammar. NB: you can ignore whitespace.
Question 13 Write a function in Scheme or rules in Prolog called countlt that takes a list of numbers, L. and another number. N. and returns the count of numbers less than N in the list L. Example calls Scheme: (countlt '(6 1 9) 4) -> 1 (countlt '(50 27 13) 1) -> 0 Prolog ?- countlt (I6, 1, 91, 4, X) . X = 1. ?- countlt ( [50, 27, 131, 1, X). X = 0. Edit View Insert Format Tools Table 12pt v Paragraph v В I U ※ 总 !!