COMPUTER SCIENCE:OVERVIEW-TEXT
12th Edition
ISBN: 2810015047178
Author: BROOKSHEAR
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 11.2, Problem 6QE
Program Plan Intro
Parsing analysis:
The parsing analysis of any statement checks the grammatical role of each word in statement.
Semantic analysis:
The semantic analysis of any statement defines the semantic role of each word in the statement.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In the simplified English grammar of the given Figure, there are only finitely many legal sentences. How
many are there? Why?
(1) sentence → noun-phrase verb-phrase .
(2) noun-phrase → article noun
(3) article →→ a | the
(4) noun → girl
| dog
(5) verb-phrase
verb noun-phrase
(6) verb → sees | pets
A database of Prolog facts for a group of people contains the following two types of facts:
male([, , ... ] ).
female ([, , ... ] ).
age( , )
E.g., male([alex, tom, vic, ...]).
E.g., female([ann, sara, ella, ..]).
E.g. age(ann, 66).
For these facts write the following rules (you may use Prolog library functions):
person(, ).
gender(, gender>).
oldest(, , ).
meanAgeM().
count(, , ).
Find the name and the age of a person
Find the name and the gender (male or female)
Find the name/age/gender of the oldest person
Find the mean age of male people
Find the number of male, female, and total people
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.
Chapter 11 Solutions
COMPUTER SCIENCE:OVERVIEW-TEXT
Ch. 11.1 - Prob. 1QECh. 11.1 - Prob. 2QECh. 11.1 - Prob. 3QECh. 11.1 - Prob. 4QECh. 11.1 - Prob. 5QECh. 11.2 - Prob. 1QECh. 11.2 - Prob. 2QECh. 11.2 - Prob. 3QECh. 11.2 - Prob. 4QECh. 11.2 - Identify the ambiguities involved in translating...
Ch. 11.2 - Prob. 6QECh. 11.2 - Prob. 7QECh. 11.3 - Prob. 1QECh. 11.3 - Prob. 2QECh. 11.3 - Prob. 3QECh. 11.3 - Prob. 4QECh. 11.3 - Prob. 5QECh. 11.3 - Prob. 6QECh. 11.3 - Prob. 7QECh. 11.3 - Prob. 8QECh. 11.3 - Prob. 9QECh. 11.4 - Prob. 1QECh. 11.4 - Prob. 2QECh. 11.4 - Prob. 3QECh. 11.4 - Prob. 4QECh. 11.4 - Prob. 5QECh. 11.5 - Prob. 1QECh. 11.5 - Prob. 2QECh. 11.5 - Prob. 3QECh. 11.5 - Prob. 4QECh. 11.6 - Prob. 1QECh. 11.6 - Prob. 2QECh. 11.6 - Prob. 3QECh. 11.7 - Prob. 1QECh. 11.7 - Prob. 2QECh. 11.7 - Prob. 3QECh. 11 - Prob. 1CRPCh. 11 - Prob. 2CRPCh. 11 - Identify each of the following responses as being...Ch. 11 - Prob. 4CRPCh. 11 - Prob. 5CRPCh. 11 - Prob. 6CRPCh. 11 - Which of the following activities do you expect to...Ch. 11 - Prob. 8CRPCh. 11 - Prob. 9CRPCh. 11 - Prob. 10CRPCh. 11 - Prob. 11CRPCh. 11 - Prob. 12CRPCh. 11 - Prob. 13CRPCh. 11 - Prob. 14CRPCh. 11 - Prob. 15CRPCh. 11 - Prob. 16CRPCh. 11 - Prob. 17CRPCh. 11 - Prob. 18CRPCh. 11 - Give an example in which the closed-world...Ch. 11 - Prob. 20CRPCh. 11 - Prob. 21CRPCh. 11 - Prob. 22CRPCh. 11 - Prob. 23CRPCh. 11 - Prob. 24CRPCh. 11 - Prob. 25CRPCh. 11 - Prob. 26CRPCh. 11 - Prob. 27CRPCh. 11 - Prob. 28CRPCh. 11 - Prob. 29CRPCh. 11 - Prob. 30CRPCh. 11 - Prob. 31CRPCh. 11 - Prob. 32CRPCh. 11 - Prob. 33CRPCh. 11 - What heuristic do you use when searching for a...Ch. 11 - Prob. 35CRPCh. 11 - Prob. 36CRPCh. 11 - Prob. 37CRPCh. 11 - Prob. 38CRPCh. 11 - Suppose your job is to supervise the loading of...Ch. 11 - Prob. 40CRPCh. 11 - Prob. 41CRPCh. 11 - Prob. 42CRPCh. 11 - Prob. 43CRPCh. 11 - Prob. 44CRPCh. 11 - Prob. 45CRPCh. 11 - Prob. 46CRPCh. 11 - Prob. 47CRPCh. 11 - Prob. 48CRPCh. 11 - Draw a diagram similar to Figure 11.5 representing...Ch. 11 - Prob. 50CRPCh. 11 - Prob. 51CRPCh. 11 - Prob. 52CRPCh. 11 - Prob. 53CRPCh. 11 - Prob. 54CRPCh. 11 - Prob. 55CRPCh. 11 - Prob. 56CRPCh. 11 - Prob. 57CRPCh. 11 - Prob. 1SICh. 11 - Prob. 2SICh. 11 - Prob. 3SICh. 11 - Prob. 4SICh. 11 - Prob. 5SICh. 11 - Prob. 6SICh. 11 - Prob. 7SICh. 11 - Prob. 8SICh. 11 - Prob. 9SICh. 11 - Prob. 10SICh. 11 - Prob. 11SICh. 11 - Prob. 12SICh. 11 - A GPS in an automobile provides a friendly voice...Ch. 11 - Prob. 14SI
Knowledge Booster
Similar questions
- For each English sentence below, write the FOL sentence that best expresses its intended meaning. 1) No person serves apples to Mary. 2) Every person who serves bananas to John enjoys grapes. 3) Every person enjoys their favorite fruitarrow_forwardIn 3-5 sentences, find out the differences/similarities between if-else, else-if and nested if.arrow_forwardConvert the following set of sentences to clausal form: S1: A (B V E) S2: E =D S3: CAF= -B S4: E = B S5: B = Farrow_forward
- Pls help ASAP on all of these questions. PLs I humbly request.arrow_forwardFormalize the following sentence in english: 3x. (foreign(x) A (work(x, y) AVy.healthcare_job(y)))arrow_forwardFor each of the following statements about regular expressions α, β and languages A, B, state whether they are true or false. Provide a one-sentence justification for each answer.arrow_forward
- In This Assignment, You Need To Solve The Following Problems Using Prolog 1. Design Rules To Find Out If A Value Is A Member Of A List. The Predicate Should Be In The Format: Mymember(value, List). For Example, Mymember(X, [1, 2, 3, 4]) Should Return X = 1. 2. Design Rules To Check If An Integer Is An Even Number Or Not. The Predicates ... This problem has been solved! See the answer Description:In this assignment, you need to solve the following problems using Prolog. 1. Design rules to find out if a value is a member of a list. The predicate should be in the format: mymember(value, list). For example, mymember(X, [1, 2, 3, 4]) should return X = 1.2. Design rules to check if an integer is an even number or not. The predicates should be in the format: myeven(a_number).3. Design rules to find out the number of even values in a list of integers. The predicates should be in the format: myevennumber(a_number, list). For example, myevennumber(X, [1, 2, 3, 4, 5, 6]) should return X = 3.4.…arrow_forwardYou are given the following context-free grammar:S → EGF HE → eE | eF → f | EG → gH → hH | hh | eQUESTIONS:1. Convert the grammar into the Chomsky normal form(show all steps of the conversion).2. Use the CYK algorithm to check if the word egehh is inthe language of the grammar.arrow_forwarda. Eliminate Left Factoring from the grammar above. b. Eliminate Left Recursive from the grammar above if there is any.arrow_forward
- S → aS | AB | B A → abA | ab B → BB | ba Using top-down parsing, find the leftmost derivation in the grammar given above for the word aababba. Please write your answer in an explanatory way like the step by step parsing solutions in your textbook. You can number branches of the parsing tree and can use your paper in landscape (horizontal) orientation while drawing the parsing tree.arrow_forwardStudy the following program: a(A,[A|B]). a(A,[C|B]) :- a(A,B). Explain in clear steps how Prolog evaluates the following query using the above program: a(b,[c,d,b,f].arrow_forwardPlease help Which of the following pairs cannot be unified (in prolog)?a. eats(fred, tomatoes, bread)=Whateverb. eats(fred, tomatoes) = eats(What, What)c. eats(fred, tomatoes) = eats/(Whom, What)d. eats(fred, tomatoes, bread) = eats(Whom, What, Bread)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education