Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 0: Q8E (page 1)

Show that the stringthe girl touches the boy with the flowerhas two different leftmost derivations in grammar G2 on page 103. Describe in English the two different meanings of this sentence.

Short Answer

Expert verified

It can be shown that the given string can be derived in two different leftmost derivations in grammar G2.

Derivation 1, gives the meaning of the sentence as that the girl used the flower to touch the boy. Derivation 2 , means that the boy is holding the flower when the girl touches her.

Step by step solution

01

Explain leftmost derivations.

The leftmost derivation is derived by using the productions from the grammar. The derivation of the string from the grammar starts at the leftmost end of the string, thus it is called leftmost derivation.

02

Show that the given string can be derived in two leftmost derivations and it has two meanings.

Consider the string,the girl touches the boy with the flowerto perform left most derivation. The string can be derived using the grammar G2on page 103 as follows.

Derivation 1:

localid="1662113548058" SENTENCE→NOUN-PHRASEVERB-PHRASESENTENCE→COMPLEX-NOUNVERB-PHRASESENTENCE→COMPLEX-NOUNCOMPLEX-VERBPREP-PHRASESENTENCE→ARTICLENOUNCOMPLEX-VERBPREP-PHRASE⇒ARTICLENOUNCOMPLEX-VERBPREP-PHRASE⇒ThegirlCOMPLEX-VERBPREP-PHRASE⇒ThegirlVERBNOUN-PHRASEPREP-PHRASE⇒ThegirltouchesNOUN-PHRASEPREP-PHRASE⇒ThegirltouchesCOMPLEX-NOUNPREP-PHRASE⇒ThegirltouchesARTICLENOUNPREP-PHRASE⇒ThegirltouchestheNOUNPREP-PHRASE⇒ThegirltouchestheboyPREP-PHRASE⇒ThegirltouchestheboyPREPCOMPLEX-NOUN⇒ThegirltouchestheboywithCOMPLEX-NOUN⇒ThegirltouchestheboywithARTICLENOUN⇒ThegirltouchestheboywiththeNOUN⇒ThegirltouchestheboywiththeflowerDerivation 2:

localid="1662113579670" SENTENCE→NOUN-PHRASEVERB-PHRASE⇒SENTENCE→COMPLEX-NOUNVERB-PHRASE⇒SENTENCE→ARTICLENOUNVERB-PHRASE⇒ARTICLENOUNVERB-PHRASE⇒TheNOUNVERB-PHRASE⇒ThegirlVERB-PHRASE⇒ThegirlCOMPLEX-VERBPREP-PHRASE⇒ThegirlVERBNOUN-PHRASEPREP-PHRASE⇒ThegirltouchesNOUN-PHRASEPREP-PHRASE⇒ThegirltouchesCOMPLEX-NOUNPREP-PHRASE⇒ThegirltouchesARTICLENOUNPREP-PHRASE⇒ThegirltouchestheNOUNPREP-PHRASE⇒ThegirltouchestheboyPREP-PHRASE⇒ThegirltouchestheboyPREPCOMPLEX-NOUN⇒ThegirltouchestheboywithCOMPLEX-NOUN⇒ThegirltouchestheboywithARTICLENOUN⇒ThegirltouchestheboywiththeNOUN⇒Thegirltouchestheboywiththeflower

Derivation 1, gives the meaning of the sentence as that the girl used the flower to touch the boy. Derivation 2 , means that the boy is holding the flower when the girl touches her.

Therefore, the string has been derived in two ways that gives two meanings.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Use the procedure described in Lemma 1.55 to convert the following regular expressions to nondeterministic finite automata.


a.(0∪1)*000(0∪1)*b.((00*11)∪01)*c.∅*

If Cis a set withcelements, how many elements are in the power set of C? Explain your answer.

Give a counterexample to show that the following construction fails to prove Theorem 1.49, the closure of the class of regular languages under the star operationLet N1=Q1,Σ,δ1,q1,F1 recognize . Construct N=Q1,Σ,δ,q1,F as follows. Nis supposed to recognize A*1.

a. The states of Nare the states of N1.

b. The start state ofN is the same as the start state ofN1 .

c. . F=q1∪F1.The accept states are the old accept states plus its start state.

d. Defineδso that for any and any a∈Σε, δq,a=(δ1q,aq6∈F1ora6=εδ1q,a∪q1q∈F1anda=ε

Use the procedure described in Lemma 1.60to convert the following finite automata to regular expressions.

Write a formal description of the following graph.
See all solutions

Recommended explanations on Computer Science Textbooks

Data Structures

Read Explanation

Problem Solving Techniques

Read Explanation

Computer Network

Read Explanation

Computer Systems

Read Explanation

Data Representation in Computer Science

Read Explanation

Computer Organisation and Architecture

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free