SlideShare a Scribd company logo
24.903
                                  Language & Structure III: Semantics and Pragmatics
                                           Spring 2003, 2-151, MW 1-2.30
                                                 February 26, 2003
                                       Assignment 3, due in class on March 5




1. Let A be an expression of type e, B of type et, C of type (et)et, and D of type (et)t. Determine whether the
following expressions are well-formed, and if yes, give the type of those expressions:

a. A(B)                                       e. D(B)
b. C(B(A))                                    f. D(B)(A)
c. C(B)                                       g. D(C(B))
d. C(B)(A)                                    h. C(C(B))(A)

2. Give the types of the subexpressions marked by ”?”, assuming that the examples are well-formed.
a. A(B), A: (e(et))t, B: ? A(B): ?
b. A(B), A(B): (et)et, B: et, A: ?
c. A(B)(C), A: ((et)t)(et)et, B: ?, C: ?, A(B)(C): ?
d. A(B)(C), A(B)(C): et, A(B): eet, B: (et)t, A:? C:?
e. A(B(C)) A(B(C)): e B: (et)t A: ? C: ?
f. Is it possible to assign types to A, B and C in such a way that both A(B(C)) and (A(B))(C) are well-formed
expressions?


3. Assume that intransitive verbs are of type et, and transitive verbs are of type eet.
a) What is the type of and as a conjunction of intransitive verbs, as in
John [sleeps and snores]?
b) What is the type of and as a conjunction of transitive verbs, as in
John [read and enjoyed] ”Ulysses”?
c) What is the type of the adverb quickly in a sentence like
John [walked quickly]?
d) What is the type of the preposition with in the sentence
John [walked [with [Mary]]]?
e) What are the types of faster and than in the sentence
John [walks [faster [than Mary]]]?
(In doing problems (3a-e) assume a binary branching structure for and.)


4. There are different conventions for naming types.
a. Translate the following three abbreviated type names to type names using the official convention of
angled brackets:
eeet, (et)et, ((et)et)(et)et
b. Translate the following three official type names to type names using the abbreviatory convention:
      Ø                   Ø

          Ø           Ø                   Ø

              Ø   Ø           Ø    Ø          Ø

More Related Content

What's hot

9.3 pythagorean theorem day 3
9.3 pythagorean theorem day 39.3 pythagorean theorem day 3
9.3 pythagorean theorem day 3bweldon
 
Theory of Automata Lesson 02
Theory of Automata Lesson 02Theory of Automata Lesson 02
Theory of Automata Lesson 02
hamzamughal39
 
Theory of automata and formal language
Theory of automata and formal languageTheory of automata and formal language
Theory of automata and formal language
Rabia Khalid
 
Lecture 6
Lecture 6Lecture 6
Lecture 6
shah zeb
 
Chapter1 Formal Language and Automata Theory
Chapter1 Formal Language and Automata TheoryChapter1 Formal Language and Automata Theory
Chapter1 Formal Language and Automata Theory
Tsegazeab Asgedom
 
Generalized transition graphs
Generalized transition graphsGeneralized transition graphs
Generalized transition graphsArham Khan G
 
Theory of Automata
Theory of AutomataTheory of Automata
Theory of Automata
Farooq Mian
 
Propositional logic
Propositional  logicPropositional  logic
Propositional logic
chauhankapil
 
Lecture 1,2
Lecture 1,2Lecture 1,2
Lecture 1,2
shah zeb
 
Math 150 fall 2020 homework 1 due date friday, october 15,
Math 150 fall 2020 homework 1 due date friday, october 15,Math 150 fall 2020 homework 1 due date friday, october 15,
Math 150 fall 2020 homework 1 due date friday, october 15,
MARRY7
 
Theory of automata and formal language
Theory of automata and formal languageTheory of automata and formal language
Theory of automata and formal language
Rabia Khalid
 
Theory of Automata Lesson 01
 Theory of Automata Lesson 01  Theory of Automata Lesson 01
Theory of Automata Lesson 01
hamzamughal39
 
Lecture 3,4
Lecture 3,4Lecture 3,4
Lecture 3,4
shah zeb
 
Lesson 05
Lesson 05Lesson 05
Semana 33 matemática 3ª série - polinômio - decomposição em fatores do 1º grau
Semana 33 matemática 3ª série   - polinômio - decomposição em fatores do 1º grauSemana 33 matemática 3ª série   - polinômio - decomposição em fatores do 1º grau
Semana 33 matemática 3ª série - polinômio - decomposição em fatores do 1º grau
GoisTec
 
Matemática semana 33 3ª série d26 - polinômio - decomposição em fatores do...
Matemática semana 33  3ª série   d26 - polinômio - decomposição em fatores do...Matemática semana 33  3ª série   d26 - polinômio - decomposição em fatores do...
Matemática semana 33 3ª série d26 - polinômio - decomposição em fatores do...
GoisBemnoEnem
 
Pfaff_Online Actions in Writing
Pfaff_Online Actions in WritingPfaff_Online Actions in Writing
Pfaff_Online Actions in Writing
josephbulls
 
Midpoint and distance
Midpoint and distanceMidpoint and distance
Midpoint and distance
lmrogers03
 
Regular Expression
Regular ExpressionRegular Expression
Regular Expression
A. S. M. Shafi
 

What's hot (20)

9.3 pythagorean theorem day 3
9.3 pythagorean theorem day 39.3 pythagorean theorem day 3
9.3 pythagorean theorem day 3
 
Theory of Automata Lesson 02
Theory of Automata Lesson 02Theory of Automata Lesson 02
Theory of Automata Lesson 02
 
Theory of automata and formal language
Theory of automata and formal languageTheory of automata and formal language
Theory of automata and formal language
 
Lecture 6
Lecture 6Lecture 6
Lecture 6
 
Chapter1 Formal Language and Automata Theory
Chapter1 Formal Language and Automata TheoryChapter1 Formal Language and Automata Theory
Chapter1 Formal Language and Automata Theory
 
Generalized transition graphs
Generalized transition graphsGeneralized transition graphs
Generalized transition graphs
 
Theory of Automata
Theory of AutomataTheory of Automata
Theory of Automata
 
Propositional logic
Propositional  logicPropositional  logic
Propositional logic
 
Lecture 1,2
Lecture 1,2Lecture 1,2
Lecture 1,2
 
Math 150 fall 2020 homework 1 due date friday, october 15,
Math 150 fall 2020 homework 1 due date friday, october 15,Math 150 fall 2020 homework 1 due date friday, october 15,
Math 150 fall 2020 homework 1 due date friday, october 15,
 
Theory of automata and formal language
Theory of automata and formal languageTheory of automata and formal language
Theory of automata and formal language
 
Theory of Automata Lesson 01
 Theory of Automata Lesson 01  Theory of Automata Lesson 01
Theory of Automata Lesson 01
 
Lecture 3,4
Lecture 3,4Lecture 3,4
Lecture 3,4
 
Lesson 05
Lesson 05Lesson 05
Lesson 05
 
Semana 33 matemática 3ª série - polinômio - decomposição em fatores do 1º grau
Semana 33 matemática 3ª série   - polinômio - decomposição em fatores do 1º grauSemana 33 matemática 3ª série   - polinômio - decomposição em fatores do 1º grau
Semana 33 matemática 3ª série - polinômio - decomposição em fatores do 1º grau
 
Matemática semana 33 3ª série d26 - polinômio - decomposição em fatores do...
Matemática semana 33  3ª série   d26 - polinômio - decomposição em fatores do...Matemática semana 33  3ª série   d26 - polinômio - decomposição em fatores do...
Matemática semana 33 3ª série d26 - polinômio - decomposição em fatores do...
 
Pfaff_Online Actions in Writing
Pfaff_Online Actions in WritingPfaff_Online Actions in Writing
Pfaff_Online Actions in Writing
 
Midpoint and distance
Midpoint and distanceMidpoint and distance
Midpoint and distance
 
1.1
1.11.1
1.1
 
Regular Expression
Regular ExpressionRegular Expression
Regular Expression
 

Viewers also liked

A7
A7A7
A6
A6A6
A1
A1A1
A4
A4A4
A5
A5A5
A2
A2A2

Viewers also liked (6)

A7
A7A7
A7
 
A6
A6A6
A6
 
A1
A1A1
A1
 
A4
A4A4
A4
 
A5
A5A5
A5
 
A2
A2A2
A2
 

A3

  • 1. 24.903 Language & Structure III: Semantics and Pragmatics Spring 2003, 2-151, MW 1-2.30 February 26, 2003 Assignment 3, due in class on March 5 1. Let A be an expression of type e, B of type et, C of type (et)et, and D of type (et)t. Determine whether the following expressions are well-formed, and if yes, give the type of those expressions: a. A(B) e. D(B) b. C(B(A)) f. D(B)(A) c. C(B) g. D(C(B)) d. C(B)(A) h. C(C(B))(A) 2. Give the types of the subexpressions marked by ”?”, assuming that the examples are well-formed. a. A(B), A: (e(et))t, B: ? A(B): ? b. A(B), A(B): (et)et, B: et, A: ? c. A(B)(C), A: ((et)t)(et)et, B: ?, C: ?, A(B)(C): ? d. A(B)(C), A(B)(C): et, A(B): eet, B: (et)t, A:? C:? e. A(B(C)) A(B(C)): e B: (et)t A: ? C: ? f. Is it possible to assign types to A, B and C in such a way that both A(B(C)) and (A(B))(C) are well-formed expressions? 3. Assume that intransitive verbs are of type et, and transitive verbs are of type eet. a) What is the type of and as a conjunction of intransitive verbs, as in John [sleeps and snores]? b) What is the type of and as a conjunction of transitive verbs, as in John [read and enjoyed] ”Ulysses”? c) What is the type of the adverb quickly in a sentence like John [walked quickly]? d) What is the type of the preposition with in the sentence John [walked [with [Mary]]]? e) What are the types of faster and than in the sentence John [walks [faster [than Mary]]]? (In doing problems (3a-e) assume a binary branching structure for and.) 4. There are different conventions for naming types. a. Translate the following three abbreviated type names to type names using the official convention of angled brackets: eeet, (et)et, ((et)et)(et)et b. Translate the following three official type names to type names using the abbreviatory convention: Ø Ø Ø Ø Ø Ø Ø Ø Ø Ø