Syntactic Theory 2 Week 5: Merge and Linearization Dustin A. Chacón February 7, 2017

1

Introduction

• In GB, D-Structure was the representation where: phrase structure is assembled in accordance with X0 -theory, theta-roles are assigned. It is also the input to movement, which produces S-Structure: (1)



CP

CP C0

C0 C

TP

C

T0 T [Pres]

John Nominative

V0

DP

Agent

T0

DPi VP

John

TP

V like Patient

T [Pres]

VP V0

DP ti DP

V like

Mary

Accusative

DP Mary

• Last time, we saw a new way to think about phrase structure, in which in place of D-Structure, we interleave Merge and Move operations, and let theta roles get assigned upon first Merge: (2)

Merge(α, β) = {γ, {α, β}}, where γ is a label meeting the conditions of X0 Theory

(3)

Merge(like,DP) = Merge(DP,V0 ) =

[ V0 like [ DP Mary[Case:Acc,Theta:Pat] ] [ VP [ DP John][Case:???,Theta:Ag] [ V0 like [ DP Mary][Case:Acc,Theta:Pat] ]] 1

Merge(T,VP) = Move [ DP John] = Merge(C,TP) =

[ T0 T[Pres] [ VP [ DP John][Case:???,Theta:Ag] [ V0 like Mary]]] [ TP [ DP John][Case:Nom,Theta:Ag]i [ T0 T[Pres] [ VP [ DP ti ] [ V0 like Mary]]] [ CP [ C0 C [ TP [ DP John][Case:Nom,Theta:Ag]i [ T0 T[Pres] [ VP ti like Mary]]]]

• A move to Merge gets rid of the commitment that theta roles are assigned before any and all movements, which we saw was necessary to account for tough-movement constructions: (4)

John is easy OPi to please ti

• At this point, we’ve replaced D-Structure with the operations Merge and the Numeration (or Lexical Array), which pre-determines the number of lexical items that will enter the derivation • In this lecture, we will examine what the move to Merge + Numeration buys us, and what other commitments we can loosen ourself from given Minimalist desiderata

2

Merge and Bare Phrase Structure

• Merge forces binary branching, given Economy conditions – 2 is the smallest thing that a combinatoric operation can be defined over • This also means there is no “unary branching” • Inclusiveness Condition: The derivation does not add any information that was not a part of the lexical array (5)

Merge(α, β) = {γ, {α, β}}, where γ = α or β

• Additionally, the Inclusiveness Condition means we no longer have “bar-levels” in our theory of phrase structure – the theory makes no allotments for the distinction between X0 /X0 /XP: (6)

Merge(like,John) = Merge(Mary, like) = Merge(T, like) = Move Mary = Merge(C, T) =

[ like like John] [ like Mary [ like like John]] [ T T [ like Mary [ like like John]]] [ T Maryi [ T T [ like ti [ like like John]]]] [ C C [ T Maryi [ T T [ like ti [ like like John]]]]]

2

(7)

C C

T

Maryi

T T

like ti

like

like

John

• Is this a good thing? Let’s re-examine the properties of X0 -Theory (Chomsky 1970) (8)

XP Specifier

X0

Adjunct

X0

X0 X0

Adjunct

Complement

• Properties of X0 Theory: a. b. c. d.

One complement adjacent to the head Multiple adjuncts, freely interleavable A single specifier at the top The properties of the head X0 “project” throughout the structure

• In Bare Phrase Structure. . . a. b. c.

Complement is the first thing to Merge with a lexical item Specifiers are the last thing to Merge with a lexical item Adjuncts are the elsewhere condition

• Hypothesis: Bare Phrase Structure implies that operations may target the maximal projection or the minimal projection, but nothing may target intermediate projection • John invited the amazing king of France from Denmark, and Mary invited. . . 3

a. b. c. d.

*the one ( = amazing king of France from Denmark) the fantastic one ( = king of France from Denmark) the amazing one from London ( = king of France ) the amazing one of Spain from Londn (= king)

• Traditionally, one-substitution is evidence for N0 -levels (Baker 1979). However, with the DP hypothesis and BPS, we can reformulate this as an operation that targets a non-minimal projection (9)



NP the

N0

the N0

amazing N0 N king

the king

amazing

from Denmark

of France

king king

king from Denmark

of France

• Head-movement always targets another head position, and phrasal movement always targets a phrasal position (Emonds 1970): (10)

XP

XP X0

YP X

X0 ZP

X

Z0 Z

Yi ti

ZP Z0

X ti

4

YP

(11)

*

XP

*

XP

X0

Zi X

X0 ZP

X

Z0 ti

YPi Z

ZP Z0

X Z

ti

• We can say that head-movement targets minimal projections, and phrasal-movement targets maximal projections. (12)

VP John V like

= V0

like John

Mary

like

=

like

Vmax John Vmin like

Mary

V Mary

• BPS allows us to keep most of our analyses that rely on X0 Theory in place, with minimizing our assumptions about what the computational system is actually representing. This is an effort in explaining why phrase structure cares about what it cares about • One upshot of BPS – a single lexical item can be both “maximal” and “minimal” at the same time: (13)

María le quiere ver a Juan Mary him want to.see Acc John ‘Mary wants to see John’

• le seems to move from the lower clause, since it receives its thematic role from the verb ver. It looks like XP movement since it isn’t blocked by the intervening heads, but it doesn’t look like head movement since it phonologizes with the higher verb queiere, being a clitic. If le is maximal/minimal, then we have the beginning of an explanation for why clitics show special behavior • Without binary branching, we lose the analysis of unergative/unaccusatives, due to the lack of unary branching:

5

(14)

VP

= V0

John

arrived John

arrived

V arrived (15)

VP V0 V fell

=

fell fell

John

John

(15)

However, the object seems to be “closer” to the verb than the subject. That is, the verb together with the object seems to determine how the subject participates in the event. (Kratzer 1996)

(16)

a. b. c. d. e. f. g.

Becca took a nap Becca took a piss Becca took a chance Becca took a turn Becca took a picture Becca took a look Becca took a penny

• Additionally, some languages morphologically encode the presence of an agent: (17)

a.

b.

barf-u karg-i-tu ice-Nom melt-Pst-3sn ‘The ice melted’ surya barf-annu karag-is-i-tu sun ice-Acc melt-Caus-Pst-3sn ‘The sun melted the ice’

(Kannada, Lidz 2003)

(Kannada, Lidz 2003

• We posit that agents are introduced by v, or “little v”, in Distributed Morphology called voi (‘voice’). This is a “light verb”, introduces causative morphology:

6

(18)

vP

a.

v0

DP Dan Agent

v

VP

V ate

DP a sandwich Patient

vP

b.

v0

DP Dan Agent

v

VP sang

vP

c.

v0

DP Dan Agent

v

VP

V break

DP the glass

Patient

d.

VP V break

DP the glass

Patient

• What goes in Spec,VP now? The little v analysis gives us an explanation for the double-object construction in English:

7

vP

(19)

v0

DP v

Dan

VP

Agent

V0

DP a book Patient

V give Recipient

PP to John

• Another upshot – we now say that the patient theta role is assigned upon merger with a V, and the agent theta role is assigned upon merger with v – there is no reliance on government! The introduction of v means that we might not need government in our theory either – that’s a good thing! (20)

Merge(like,John) = Merge(v,like) = Merge(Mary,v) =

[ v Mary[Theta:Agent]

[ like like John[Theta:Pat] ] [ v v [ like like John[Theta:Pat] ]] [ v v [ like like John[Theta:Pat] ]]]

• In a Merge-based system, satisfying features is the name of the game. A head merges with a complement in order to satisfy its selectional features, and presumably this is the basis on which labeling occurs. That is, when devour merges with a DP, it’s to satisfy devour’s lexically specified requirement for a D complement, triggering the Labeling algorithm to label the resulting structure a projection of devour (21)

Merge(devour,it) =

[ devour devour[D] it[D] ]

• In Minimalism, we’ll place a lot of explanatory weight on features being introduced and then “checked” or “valued” in the derivation. Since Minimalism is a derivational theory, and Economy considerations imply that the derivation won’t do anything unless it has to, when and where features are introduced and checked will be crucial to our analyses.

3

Movement

• Inclusiveness Condition: The derivation does not add any information that was not a part of the lexical array • Traces are theory-interal objects that GB postulates to ensure that theta-roles (a D-Structure concept) are “legible” at LF

8

• Reconstruction phenomena and binding phenomena imply that traces are representationally live: (22)

S-Structure: It was unknown [ CP [which pictures of himselfi ]j John liked e j ]

(23)

John j wondered [[ti how proud of himselfi/∗ j ] Ivani was]

• What is the minimal theory of traces? There are none! Instead, we posit that traces are lower copies of the same phrase • Two distinct copy theories of movement: (24)

Copy Theory of Movement (v 1.0): Copy a syntactic object from the structure, and the Merge it at the root, as required by the Extesnion Condition (Chomsky 1995)

(25)

Merge(like,John) = Merge(v,like) = Merge(Mary,v) = Merge(T,v) = Copy Mary = Merge(Mary,v) =

(26)

Copy Theory of Movemet (v 2.0): Merge may be “external” (merging from the Lexical Array) or “internal” (merging something previously merged); these are the same operation (Chomsky 2001)

(27)

Merge(like,John) = Merge(v,like) = Merge(Mary,v) = Merge(T,v) = Merge(Mary,v) =

[ like like John] [ v v [ like like John]] [ v Mary [ v v [ like like John]]] [ T T [ v Mary [ v v [ like like John]]]] Mary, [ T T [ v Mary [ v v [ like like John]]]] [ T Mary [ T T [ v Mary [ v v [ like like John]]]]]

[ like like John] [ v v [ like like John]] [ v Mary [ v v [ like like John]]] [ T T [ v Mary [ v v [ like like John]]]] [ T Mary [ T T [ v Mary [ v v [ like like John]]]]]

• On CToM v1.0, Move is two operations – Copy and Merge. On CToM v2.0, they are the same operation. Functionally, these theories are almost identical (Chomsky 1995) • However, Chomsky (1995) proposes that CToM v1.0 makes a prediction – if Move is actually 2 suboperations, then there should be a Merge Over Move preference – if the derivation may merge something from the lexical array or move something downstairs, it should merge from the lexical array first Thereti seems ti to be a cat here *There seems a cati to be ti here

(28)

a. b.

(29)

Merge(a cat, here) = Merge(be, here) = Merge(to, here) = Merge(there,to) = Merge(seem, to) = Merge(T, seem) =

[ T T [ seem 9

[ here [a cat] here] [ be be [ here [a cat] here]] [ to to [ be be [ here [a cat] here]]] [ to there [ to to [ be be [ here [a cat] here]]]] [ seem seem [ to there [ to [ here [a cat] here]]]] seem [ to there [ to to [ be be [ here [a cat] here]]]]]]

Copy there = Merge(there,T) = (30)

there, [ T T [ seem seem [ to there [ to to [ be be [ here [a cat] here]]]]]] [ T there [ T T [ seem seem [ to there [ to to [ be be [ here [a cat] here]]]]]]]

Merge(a cat, here) = [ here [a cat] here] Merge(be, here) = [ be be [ here [a cat] here]] Merge(to, here) = [ to to [ be be [ here [a cat] here]]] Copy a cat = [a cat], [ to to [ be be [ here [a cat] here]]] Merge(a cat, T) = [ to [a cat] [ to to [ be be [ here [a cat] here]]]] Merge(seem, to) = [ seem seem [ to [a cat] [ to to [ be be [ here [a cat] here]]]]] Merge(T, seem) = [ T T [ seem seem [ to [a cat] [ to to [ be be [ here [a cat] here]]]]]] Merge(there, T) = [ T there [ T T [ seem seem [ to [a cat] [ to to [ be be [ here [a cat] here]]]]]]]

• If (28-b) is bad because it has a less economical derivation (i.e., there’s a step in which we do more than is necessary), then this implies that CToM v1.0 is the right way to go • Either way, both versions of the copy theory of movement make the same proposal – traces don’t exist, but lower copies do. If so, why is the following ungramamtical?: (31)

*John was seen John

(32)

Merge(John, seen) = Merge(was, seen) = Merge(John, was) =

[ was

[ seen seen John] [ was was [ seen seen John]] John [ was was [ seen seen John]]]

• We propose that PF has an Economy condition of its own – delete lower copies for ease of articulation (33)

Spell-Out: John was seen John PF: John was seen John

• This explains why “traces” are silent • However, there are cases where long-distance movement has a phonological effect. First, recall that subjacency requires us to postulate that long-distance movement is successive-cyclic (Chomsy 1977): (34)

[ CP whoi did [ TP John [ VP say [ CP ti0 that [ TP Mary [ VP liked ti ]]]]]]

• In some Germanic varieties, we find intermediate copies having phonological realizations: (35)

a.

b.

1 German

[ CP Weni glaubst du [ CP weni0 [ TP sie ti getroffen hat? ]]] when think you when she met has ‘When do you think she has met?’ [ CP Weri tinke jo [ CP wêr’ t [ TP Jan ti wennet? ]]] Where think you where that-cl Jan resides ‘Where do you think that Jan resides’

and Frisian taken from Felser (2004)

10

(German) (Frisian)1

• If PF can delete copies, perhaps LF can too. Recall: (36)

Jane j wondered which picture of herselfi/j Irene liked ti

(37)

Spell-Out: Jane wondered which picture of herself Irene liked which picture of herself PF: Jane wondered which picture of herself Irene liked which picture of herself LF: Jane j wondered which picture of herself Irene liked which picture of herself Jane wondered which picture of herself Irenei liked which picture of herselfi

• Optionality for LF copy deletion can explain these kind of reconstruction asymmetries – if binding occurs at LF • This raises a question – if intermediate copies can sometimes appear at PF, and if LF copies can freely delete as one remains – why does PF in general require the lower copy of a movement chain to delete? We’ll examine this question when dealing with linearization

4

Linearization

• Inclusiveness Condition: The derivation does not add any information that was not a part of the lexical array • Head-Directionality Parameter: A head and complement may surface as [ X0 X YP] or [ X0 YP X] • Merge is an operation that forms sets, which are definitionally unordered – i.e., the two trees are “the same” from the perspective of the syntax: (38)

=

α α

β

α β

α

• Related issues?: Specifiers always are to the left; adjuncts are often to the left, and movement is almost always to the left • Proposal: PF imposes linear order on structure, structure has no notion of order • Linear Correpsondence Axiom (LCA), or Antisymmetry: If α c-commands β, then α ≺ β (Kayne 1994, Chomsky 1995) • Spell-Out: [ will John [ will will [ go go [ to to [ the the [ store store]]]]]] PF: John ≺ will ≺ go ≺ to ≺ the ≺ store • Movement is always to a c-commanding position → movement is always “left” • The LCA has the unfortunate consequence of implying that all languages are in some sense underlyingly SVO – the only way to get an object above a verb is to move it:

11

(39)

R¯am-ne Sit¯a-ko pasand kart¯a hai Ram-Erg Sita-Acc like do Pres ‘Ram likes Sita’ R¯am-ne Sit¯a-koi [ VP pasand kart¯a hai ti ]

a.

b.

• More recent approaches have suggested that PF requires that c-commad map onto linearization, but can arbitrarily choose whether X0 ≺Comp or Comp≺X0 . Additionally, Bieberauer et al (2007) have proposed that languages can choose for specified syntactic domains how Merge is linearized. • Regardless, the idea that syntactic structures are one-dimensional, and PF imposes linearization, is still a important idea. Additionally, as you will see in the homework, linearization algorithms can be used to explain some important phenomena.

5

Outstanding Issues

• Features drive all operations in Minimalism. Additionally, Bare Phrase Structure tells us that X0 =X0 =XP=X. What’s unusual about the following derivation?: XP

(40)

X0

YP X

YP

• Grohmann (2003), Abels (2003) propose that there is a “anti-locality” ban that requires movement cross at least one phrase – it may be that Merge(α,β) followed by another instance of Merge(α,β) should be disallowed, since the first merger should discharge whatever features α needed from β and vice versa • The “First Merge” problem: (41)

= α ≺ β or β ≺ α?

α α

β

• One possibility – null structure that forces c-command? Forced movement to break up symmetric c-command (Moro 2000)? Treat foot of the tree as a single phonological word? • How is the following tree constructed using Merge? How is it linearized?:

12

(42)

C C

will

thei the tall

will

cat

v

will cat

ti

v v

chase

chase the

the dog

• Issue one: We seem to need to have two “work-spaces” to handle the left-branching structure: (43)

Some Merges: Some Other Merges: Merge(the, v):

[ v [ the the [ cat

[ the the [ cat tall cat]] [ v v [ chase chase [ the the dog ]]] tall cat]] [ v v [ chase chase [ the the dog ]]]]

• If we have two “work-spaces”, how do we understad the Extension Condition? In a later Homework, you will explore the implications of distinct work-spaces, and examine Nunes’s (2001) “sidewards movement” approach to Parasitic Gaps and ATB movement, which relies on movement between workspaces before Merging them together • This doesn’t solve the linearization problem – the T0 and subject DP mutually c-command one another, implying that they have to precede each other!! (44)

the ≺ will ≺ v ≺ chase ≺ the ≺ dog; will ≺ the

• One possibility: We Spell-Out the left branching material before Merging it, the Merge it as a single word (“Multiple Spell-Out”, Uriagereka 1999) (45)

Some Merges: [ the the [ cat tall cat]] Spell-Out: thetallcat Some Other Merges: [ v v [ chase chase [ the the dog ]]] Merge(thetallcat, v): [ v thetallcat [ v v [ chase chase [ the the dog ]]] ... [ C C [ will thetallcat [ will will [ v thetallcat [ v v [ chase chase [ the the dog]]]]]]]

13

(46)

thetallcat ≺ will ≺ chase ≺ the ≺ dog

• On the copy theory of movement, how do we distinguish these two representations? (47)

a. *Maryi likes ti Spell-Out: Mary likes Mary PF: Mary likes Mary b.

Mary1 likes Mary2 Spell-Out: Mary likes Mary PF: Mary likes Mary

• We need some way to distinguish copies of the same phrase and different instances of the same lexical item.

Bibliography Abels, Klaus. 2003. Successive Cyclicity, Anti-Locality, and Adposition Stranding. PhD Thesis, UConn. Baker, C.L. 1979. Syntactic Theory and the Projection Problem. Syntactic Theory and the Projection Problem 10(4), 533–581. Bieberauer, Theresa, Anders Holmberg, & Ian Roberts. 2007. Disharmonic word-order systems and the Final-OverFinal-Constraint (FOFC). In A. Bisetto & F. Barbieri (eds.), The Proceedings of the XXXIII Incontro di Grammatica Generativa, 86–105. Chomsky, Noam. 1970. Remarks on nominalization. In R. Jacobs & P. Rosenbaum (eds.), Readings in English Transformational Grammar, 184–221. Waltham: Ginn. Chomsky, Noam. 1977. On WH-Movement. In P. Culicover, A. Akmajian, & T. Wasow (eds.), Formal Syntax, 71–133. New York: Academic Press. Chomsky, Noam. 1995. The Minimalist Program. Cambridge: MIT Press. Chomsky, Noam. 2001. Beyond Explanatory Adequacy. MIT Occasional Papers in Linguistics 20. Cambridge: MITWPL. Emonds, Joseph E. 1970. Root and Structure-Preserving Transformations. PhD Thesis, MIT. Felser, Claudia. 2004. Wh-copying, phases, and successive cyclicity. Lingua 114, 543–574. Grohmann, Kleanthes. 2003. Prolific Domains. On the Anti-Locality of Movement Dependencies. Amsterdam: John Benjamins. Kayne, Richard. 1994. The Antisymmetry of Syntax. Cambridge: MIT. Kratzer, Angelika. 1996. Severing the External Argument from the Verb. In J. Rooryck & L. Zaring (eds.), Phrase Structure and the Lexicon, 109–138. Dordrecht: Kluwer. Lidz, Jeffrey. 2003. Causation and reflexivity in Kannada. In V. Dayal & A. Mahajan (eds.), Clause Structure in South Asian Languages, 93–130. Dordrecht: Kluwer. Moro, Andrea. 2000. Dynamic Antisymmetry. Cambridge: MIT Press. Nunes, Jairo. 2001. Sideward Movement, Linguistic Inquiry 31(2), 303–344. Uriagereka, Juan. 1999. Multiple Spell-Out. In S.D. Epstein & N. Hornstein (eds.), Working Minimalism, 251–282. Cambridge: MIT Press.

14

Syntactic Theory 2 Week 5: Merge and ... - Dustin Alfonso Chacón

Feb 7, 2017 - maximal/minimal, then we have the beginning of an explanation for why clitics show special ..... In P. Culicover, A. Akmajian, & T. Wasow (eds.) ...

154KB Sizes 0 Downloads 55 Views

Recommend Documents

Syntactic Theory 2 Week 4: Minimalism - Dustin Alfonso Chacón
Jan 29, 2017 - DS: [TP T [VP seems [TP to [VP be likely [TP 3.Sg.M to [VP win]]]]]] ... There were many arrows that didn't hit the target ..... Cambridge, MA: Cam-.

Syntax 2 Week 1: Introduction; GB vs. Minimalism - Dustin Alfonso ...
Aug 1, 2017 - Speakers of English can understand a variety of novel expressions: (1). My cat Ernie ... sound and meaning in a systematic way. • We also ...

Syntactic Theory 2 Week 2: X0-Theory Review
Sep 11, 2017 - mars (CFG), a tool borrowed from computer science. .... Phrases that move typically target specifier positions, as do subjects and possessors.

Syntactic Theory 2 Week 8: Harley (2010) on Argument Structure
Mar 14, 2017 - ture of a clause, for instance, whether the meaning of the predicate has a natural end point. (=telos):. (32) a. John shot the bear *for an hour / in ...

syntactic derivation and the theory of matching ...
operation of concatenation (+) defined over syntactic objects. .... 2 The discussion of displacement and its relation to the design features of narrow syntax is not a trivial issue in generative ... a mapping between various PMs within a derivation?

syntactic derivation and the theory of matching ...
Requirements for the Degree. DOCTOR OF .... In the past five years, I have received a solid training at USC, thanks to the teaching of the ..... 1 This distinction was adopted from computer science when formal grammar was postulated in the.

SPPS Newsletter Term 2 - Week 5 - 2018.pdf
groups and articles and make connections. with their own experiences. In oral reading. the focus on fluency, reading with speed. and expression continues.

Term 2 Week 5 - 09.03.18.pdf
Mar 9, 2018 - Page 1 of 3. WORLD BOOK DAY. A big thank you to. everyone who. attended the. academy on. Thursday dressed as. a beloved literary. character. Characters ranging. from Oompa. Loompas from Roald. Dahl's 'Charlie and. the Chocolate Factory'

Week 5.pdf
Giddy- Up! July 11 - 15 Rising grades PK-1. 9:00 a.m. – 12:00 p.m.. Calling all western enthusiasts ready to have a WILD time! Each day cowboys and cowgirls will. saddle up to the ranch at CFA and create and make cowboy crafts, have teepee time aro

WEEK 1 WEEK 2 WEEK 3 - Aspens Services
All Day Breakfast. Meat or Vegetarian. Lasagne ... Apple Pie with custard. Winter Berry Sponge with custard. Chocolate Krispie. WEEK 2. 11th Sept, 2nd Oct, ...

Dustin Hawks
rank given to a musician during the baroque age. ... progressive and famous university. It was also one of the .... Bloomington: Indiana University Press. Baroque ...

5 WEEK SCIENCE.pdf
Page 1 of 1. Page 1 of 1. 5 WEEK SCIENCE.pdf. 5 WEEK SCIENCE.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying 5 WEEK SCIENCE.pdf. Page 1 of 1.

Vegan Week 2
Jan 10, 2017 - Vegetable - Red Pepper - Raw, 0.67 Pepper. 31 .... Peppers, Red Bell, Generic - Peppers, Red, 1 Cup. 60 .... Nuts, pine nuts, dried, 0.25 cup.

week 5 newsletter.pdf
Contact Details: [email protected] or Kate Donaldson 027 6229226. Ash Wednesday ... award winning patch. 100 Bulbs. $50. 50 Bulbs. $25. 20 Bulbs. $10. Orders and payment to St Gerards office by 3rd March. Email: [email protected]. p

A Complete, Co-Inductive Syntactic Theory of ... - Research at Google
Denotational semantics and domain theory cover many pro- gramming language features but straightforward models fail to cap- ture certain important aspects of ...

Merge Sort - CS50 CDN
Data stored in memory has both a value and a location. • Pointers contain the memory address of some piece of data. • * pointer contains address to a ...

Term 2 Week 2.pdf
On Monday mornings we will sing the National Anthem and do birthday announcements and pencils and. for the following days the students will be asked to ...

Per 2 Int 2 Week 5 Day 1.pdf
Sign in. Page. 1. /. 8. Loading… Page 1 of 8. Page 1 of 8. Page 2 of 8. Page 2 of 8. Page 3 of 8. Page 3 of 8. Per 2 Int 2 Week 5 Day 1.pdf. Per 2 Int 2 Week 5 Day ...

Week 2.pptx - CS50 CDN
Two Types of Variables: • Local Variables. – Declared inside of a funcion. – Exist only within that funcion. • Global Variables. – Declared outside of all funcfions.

Week 2.pptx - CS50 CDN
Reusability – funcions can be re-‐called! Page 5. Anatomy of a Funcion in C. . (arg1, ..., argn). {. // code goes here. } Page 6 ...