CAS LX 522 Syntax I. X-bar Theory: NP. X-bar Theory: NP. X-bar Theory: NP. X-bar Theory: NP. Week 3. X-bar Theory

Size: px
Start display at page:

Download "CAS LX 522 Syntax I. X-bar Theory: NP. X-bar Theory: NP. X-bar Theory: NP. X-bar Theory: NP. Week 3. X-bar Theory"

Transcription

1 CAS L 522 Syntax I Week 3. -bar Theory Back to trees: -bar Theory Consider our current rule: : (D) (+) (+) This yields a flat structure where all components D c-command each or. D this book -bar Theory: I bought this book with. You bought this small one. -bar Theory: We can substitute one for book with, which should mean book with is a constituent, but it isn t in our structure. D D this book this book -bar Theory: I bought this small one with red. We can also substitute one in for book alone, which should thus also be a constituent. -bar Theory: This suggests a more deeply embedded structure:?? D D this book this book 1

2 -bar Theory: We ll call se intermediate nodes (-bar). otice that you can also say I bought this one. D this book -bar Theory: So, our final looks like this: D this book -bar Theory: We need to break up our rule; instead : (D) (+) (+) We have: : (D) : : : () otice that se yield same results on surface (note recursion and optionality) but produce different structures (in terms constituency). otice also that under se rules, any node has no more than two daughters (binary branching). -bar Theory: V The same kind thing holds V as well as. Instead using one (which stands for ) we can try doing replacements using do so, and we ll get a very similar result. Our old rule generated a flat structure for V as well (all s, s, Cs, etc. in a V c-command each or). V: (Adv+) V ({/C}) (+) (Adv+) -bar Theory: V V: (Adv+) V ({/C}) (+) (Adv+) I quickly left after Mary did so. I left quickly after Mary did so. I ate pizza with gusto and Mary did so with quiet reserve. I ate pizza with gusto immediately and Mary did so later. -bar Theory: V Again, it looks like we need to break our rule into parts using V! (for which do so can substitute). V: (Adv+) V ({/C}) (+) (Adv+) To: V: V! V! : Adv V! V! : V! V! : V! Adv V! : V ({/C}) Again, this is (almost) same on surface, but yields a different structure. And again, binary. 2

3 -bar Theory: V Our new rules do not quite make same predictions about surface strings Vs, however. The old rules had (+) before (Adv+), new rules allow m to intermingle. But that s actually better: John grabbed book quickly from table triumphantly. John grabbed book f table quickly with a devilish grin -bar Theory: We should now be growing suspicious our or rules, now that we have had to split up and V and introduce and V! nodes. The governor was [ very concerned about housing costs ]; tenants were [ even more so ]. The studio was [ unusually pleased with its actors and confident success ]. The first statement was true; second was less so. This gives us evidence : (Adv)!! : () -bar Theory: The frisbee landed on ro. It landed right on edge. John knocked it right f ro and into trashcan. Mark was at odds with his supervisor. Mark was in love and at odds with his supervisor. So, this gives us (assuming right is an ): : ()!! :! ()! : D -bar ory The main idea behind -bar ory is to explain similarity between rules for each category. It is an attempt to generalize over rules we have. : ()!! :! ()! : D : (Adv)!! : () : (D) : : : () V: V! V! : Adv V! V! : V! V! : V! Adv V! : V ({/C}) -bar ory -bar ory The in -bar ory is a variable over categories. When we talk, we mean to be describing any kind phrase (V,,, Adv,, T, C, ). : ()!! :! ()! : D : (Adv)!! : () : (D) : : : () V: V! V! : Adv V! V! : V! V! : V! Adv V! : V ({/C}) The rules all have following form: : Z : (Y) : (Y) : (W) : ()!! :! ()! : D : (Adv)!! : () : (D) : : : () V: V! V! : Adv V! V! : V! V! : V! Adv V! : V ({/C}) 3

4 -bar ory -bar ory -bar ory elevates this to a principle phrase structure; it hyposizes that all phrases in a syntactic tree conform to this template. : (Z) A phrase () consists optionally anor phrase and a barlevel projection (). : Y or : Y A bar-level projection () can consist anor and anor phrase (recursive). : (W) A bar-level projection () consists a head same category () and optionally anor phrase. Structurally, this looks like this ( course, re can be any number nodes, here we see three). Different parts this structure are given different names (and y act different from one anor, as we ll see). Z Y Y W -bar ory -bar ory The phrase which is immediately dominated by (designated Z here) is specifier. A phrase dominated by and sister is an adjunct. The phrase which is sister to is complement. Z Y Y W We have posited a structural difference between complements (W here, which re is only one) and adjuncts (Y here, which re can be any number), and so we should expect to find that y behave differently. Consider Z Y Y W -bar Theory: The head this is book. -bar Theory: The head this is book. The complement is. D D book book 4

5 -bar Theory: The head this is book. The complement is. With and are D book adjuncts. -bar Theory: The head this is book. The complement is. With and are D book adjuncts. The is in specifier position. ote: D here is not a phrase; it does not conform to -bar ory. We will fix this soon. -bar ory: The complement a head (e.g., in a book ) tends to feel more intimately related to head. Compare a book on table. The complement in English is almost always introduced by preposition. -bar ory allows for only one complement, and indeed in we cannot have two -s this sort: *The book fiction Cf. The book and fiction -bar ory: An adjunct, on or hand, feels more optional A book on table -bar ory allows for any number adjuncts (not just one, like with complements). The book with on third shelf about C++ uncts can generally be re-ordered freely. The book with about C++ on third shelf The book about C++ with on third shelf The book about C++ on third shelf with The book on third shelf with about C++ The book on third shelf about C++ with -bar ory: -bar ory: -bar structure also predicts that complement an must be first; it cannot be re-ordered with respect to Z adjunct s. The book with on third shelf *The book with on third shelf *The book on third shelf with *The book with on third shelf Y Y W Or tests differentiate adjuncts and complements too. Conjoining two elements a given category yields an element same category; if conjunction is possible two conjuncts are same category. You cannot conjoin a complement and an adjunct (where could it go in structure?), although you can conjoin complements and you can conjoin adjuncts: The book and essays The book with and with red spine *The book and with red spine 5

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets: L322 Syntax Chapter 3: Structural Relations Linguistics 322 1 The Parts of a Tree A tree structure is one of an indefinite number of ways to represent a sentence or a part of it. Consider the following

More information

The anatomy of a syntax paper

The anatomy of a syntax paper The anatomy of a syntax paper Seminar week 4: Understanding the Theory of Syntax, Summer 2014 Asad Sayeed Uni-Saarland Asad Sayeed (Uni-Saarland) The anatomy of a syntax paper 1 There is a special secret

More information

1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns

1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns Lecture 9: Propositional Logic I Philosophy 130 23 & 28 October 2014 O Rourke I. Administrative A. Problem sets due Thursday, 30 October B. Midterm course evaluations C. Questions? II. Logic and Form A.

More information

Activity Report at SYSTRAN S.A.

Activity Report at SYSTRAN S.A. Activity Report at SYSTRAN S.A. Pierre Senellart September 2003 September 2004 1 Introduction I present here work I have done as a software engineer with SYSTRAN. SYSTRAN is a leading company in machine

More information

CS1 Lecture 22 Mar. 6, 2019

CS1 Lecture 22 Mar. 6, 2019 CS1 Lecture 22 Mar. 6, 2019 HW 5 due Friday Questions? In discussion exams next week Last time Ch 12. Zip, lambda, etc Default/keyword function parameters Ch 19 conditional expresssions, list comprehensions

More information

CHAPTER 5: PRINCIPLES OF DETAILED DESIGN

CHAPTER 5: PRINCIPLES OF DETAILED DESIGN CHAPTER 5: PRINCIPLES OF DETAILED DESIGN SESSION II: STRUCTURAL AND BEHAVIORAL DESIGN OF COMPONENTS Software Engineering Design: Theory and Practice by Carlos E. Otero Slides copyright 2012 by Carlos E.

More information

Ling 571: Deep Processing for Natural Language Processing

Ling 571: Deep Processing for Natural Language Processing Ling 571: Deep Processing for Natural Language Processing Julie Medero January 14, 2013 Today s Plan Motivation for Parsing Parsing as Search Search algorithms Search Strategies Issues Two Goal of Parsing

More information

Lesson 1. Introduction to Programming OBJECTIVES

Lesson 1. Introduction to Programming OBJECTIVES Introduction to Programming If you re new to programming, you might be intimidated by code and flowcharts. You might even wonder how you ll ever understand them. This lesson offers some basic ideas and

More information

F08: Intro to Composition

F08: Intro to Composition F08: Intro to Composition Semantics - Ling 331/731 University of Kansas 1 erbs as functions (1). Here is a sadly simplified sentence structure: S P P There are two lexical items that feed this structure:

More information

Read & Download (PDF Kindle) Writing Compilers And Interpreters

Read & Download (PDF Kindle) Writing Compilers And Interpreters Read & Download (PDF Kindle) Writing Compilers And Interpreters Quickly master all the skills you need to build your own compilers and interpreters in C++ Whether you are a professional programmer who

More information

Syntax 380L December 4, Wh-Movement 2. For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout.

Syntax 380L December 4, Wh-Movement 2. For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout. Syntax 380L December 4, 2001 Wh-Movement 2 For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout. 1 The Basics of wh-movement (1) Who i does John think

More information

F15: Formalizing definiteness

F15: Formalizing definiteness F15: Formalizing definiteness Ling 331 / 731 Spring 2016 We saw how the truth-conditional meaning of definiteness involves reference and a presupposition of uniqueness We know the syntactic structure of

More information

Lecture 2: SML Basics

Lecture 2: SML Basics 15-150 Lecture 2: SML Basics Lecture by Dan Licata January 19, 2012 I d like to start off by talking about someone named Alfred North Whitehead. With someone named Bertrand Russell, Whitehead wrote Principia

More information

Module 8: Local and functional abstraction

Module 8: Local and functional abstraction Module 8: Local and functional abstraction Readings: HtDP, Intermezzo 3 (Section 18); Sections 19-23. We will cover material on functional abstraction in a somewhat different order than the text. We will

More information

LING 130: Quantified Noun Phrases

LING 130: Quantified Noun Phrases LING 130: Quantified Noun Phrases James Pustejovsky March 15, 2010 1 Syntax for Typed λ-calculus We will now present a language which uses specific types of entities, where the entities are combined with

More information

INTRODUCTION TO INTEGRATION STYLES

INTRODUCTION TO INTEGRATION STYLES INTRODUCTION TO INTEGRATION STYLES Enterprise integration is the task of making separate applications work together to produce a unified set of functionality. Some applications may be custom developed

More information

Trees, Trees and More Trees

Trees, Trees and More Trees Trees, Trees and More Trees August 9, 01 Andrew B. Kahng abk@cs.ucsd.edu http://vlsicad.ucsd.edu/~abk/ How You ll See Trees in CS Trees as mathematical objects Trees as data structures Trees as tools for

More information

CS131 Typed Lambda Calculus Worksheet Due Thursday, April 19th

CS131 Typed Lambda Calculus Worksheet Due Thursday, April 19th CS131 Typed Lambda Calculus Worksheet Due Thursday, April 19th Name: CAS ID (e.g., abc01234@pomona.edu): I encourage you to collaborate. collaborations below. Please record your Each question is worth

More information

Program Verification & Testing; Review of Propositional Logic

Program Verification & Testing; Review of Propositional Logic 8/24: p.1, solved; 9/20: p.5 Program Verification & Testing; Review of Propositional Logic CS 536: Science of Programming, Fall 2018 A. Why Course guidelines are important. Active learning is the style

More information

Decision Trees Oct

Decision Trees Oct Decision Trees Oct - 7-2009 Previously We learned two different classifiers Perceptron: LTU KNN: complex decision boundary If you are a novice in this field, given a classification application, are these

More information

Statistics Case Study 2000 M. J. Clancy and M. C. Linn

Statistics Case Study 2000 M. J. Clancy and M. C. Linn Statistics Case Study 2000 M. J. Clancy and M. C. Linn Problem Write and test functions to compute the following statistics for a nonempty list of numeric values: The mean, or average value, is computed

More information

The Earley Parser

The Earley Parser The 6.863 Earley Parser 1 Introduction The 6.863 Earley parser will work with any well defined context free grammar, including recursive ones and those containing empty categories. It can use either no

More information

CS152: Programming Languages. Lecture 11 STLC Extensions and Related Topics. Dan Grossman Spring 2011

CS152: Programming Languages. Lecture 11 STLC Extensions and Related Topics. Dan Grossman Spring 2011 CS152: Programming Languages Lecture 11 STLC Extensions and Related Topics Dan Grossman Spring 2011 Review e ::= λx. e x e e c v ::= λx. e c τ ::= int τ τ Γ ::= Γ, x : τ (λx. e) v e[v/x] e 1 e 1 e 1 e

More information

Using GitHub to Share with SparkFun a

Using GitHub to Share with SparkFun a Using GitHub to Share with SparkFun a learn.sparkfun.com tutorial Available online at: http://sfe.io/t52 Contents Introduction Gitting Started Forking a Repository Committing, Pushing and Pulling Syncing

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 1. Statement of the Problem, Outline of the Solution to Come (1) The Key Problem There is much to recommend an algebraic

More information

Spam. Time: five years from now Place: England

Spam. Time: five years from now Place: England Spam Time: five years from now Place: England Oh no! said Joe Turner. When I go on the computer, all I get is spam email that nobody wants. It s all from people who are trying to sell you things. Email

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spanning Trees 5 7 1 6 7 6 8 2 3 4 12 1 9 5 7 1 6 7 6 8 2 3 4 12 This This graph graph is is not not connected. connected. 1 9 5 7 1 6 7 6 8 2 3 4 12 There There is is a a cycle cycle in in this

More information

(Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017

(Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017 Integrated Introduction to Computer Science Hughes (Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017 Contents 1 Announcements 1 2 Evaluation Correction 1 3 Lists 2

More information

For searching and sorting algorithms, this is particularly dependent on the number of data elements.

For searching and sorting algorithms, this is particularly dependent on the number of data elements. Looking up a phone number, accessing a website and checking the definition of a word in a dictionary all involve searching large amounts of data. Searching algorithms all accomplish the same goal finding

More information

Functional abstraction. What is abstraction? Eating apples. Readings: HtDP, sections Language level: Intermediate Student With Lambda

Functional abstraction. What is abstraction? Eating apples. Readings: HtDP, sections Language level: Intermediate Student With Lambda Functional abstraction Readings: HtDP, sections 19-24. Language level: Intermediate Student With Lambda different order used in lecture section 24 material introduced much earlier sections 22, 23 not covered

More information

Functional abstraction

Functional abstraction Functional abstraction Readings: HtDP, sections 19-24. Language level: Intermediate Student With Lambda different order used in lecture section 24 material introduced much earlier sections 22, 23 not covered

More information

CSCE 314 Programming Languages

CSCE 314 Programming Languages CSCE 314 Programming Languages Syntactic Analysis Dr. Hyunyoung Lee 1 What Is a Programming Language? Language = syntax + semantics The syntax of a language is concerned with the form of a program: how

More information

CS1102: Macros and Recursion

CS1102: Macros and Recursion CS1102: Macros and Recursion Kathi Fisler, WPI October 5, 2009 This lecture looks at several more macro examples. It aims to show you when you can use recursion safely with macros and when you can t. 1

More information

Binary Trees

Binary Trees Binary Trees 4-7-2005 Opening Discussion What did we talk about last class? Do you have any code to show? Do you have any questions about the assignment? What is a Tree? You are all familiar with what

More information

Lecture 16: Sorting. CS178: Programming Parallel and Distributed Systems. April 2, 2001 Steven P. Reiss

Lecture 16: Sorting. CS178: Programming Parallel and Distributed Systems. April 2, 2001 Steven P. Reiss Lecture 16: Sorting CS178: Programming Parallel and Distributed Systems April 2, 2001 Steven P. Reiss I. Overview A. Before break we started talking about parallel computing and MPI 1. Basic idea of a

More information

Guide to the MBTI Products Refresh (February 2016)

Guide to the MBTI Products Refresh (February 2016) CPP is introducing design and content enhancements to the following products: the MBTI Communication Style Report, the MBTI Personal Impact Report, and the Introduction to Myers-Briggs Type and Communication

More information

Programming for the Non-Programmer Examples of programming concepts and terms for the rest of us. Laurie Weaver

Programming for the Non-Programmer Examples of programming concepts and terms for the rest of us. Laurie Weaver Programming for the Non-Programmer Examples of programming concepts and terms for the rest of us Laurie Weaver Programming for the Non-Programmer Programming and programmers can seem very mysterious to

More information

Clausal Architecture and Verb Movement

Clausal Architecture and Verb Movement Introduction to Transformational Grammar, LINGUIST 601 October 1, 2004 Clausal Architecture and Verb Movement 1 Clausal Architecture 1.1 The Hierarchy of Projection (1) a. John must leave now. b. John

More information

Lecture 5. Logic I. Statement Logic

Lecture 5. Logic I. Statement Logic Ling 726: Mathematical Linguistics, Logic. Statement Logic V. Borschev and B. Partee, September 27, 2 p. Lecture 5. Logic I. Statement Logic. Statement Logic...... Goals..... Syntax of Statement Logic....2.

More information

The Diagonal Lemma: An Informal Exposition

The Diagonal Lemma: An Informal Exposition The Diagonal Lemma: An Informal Exposition Richard G Heck, Jr At the heart of Gödel s incompleteness theorem is the so-called diagonal lemma whose purpose is to allow us to construct self-referential sentences,

More information

Drawing Hands, by M. C. Escher (lithograph, 1948)

Drawing Hands, by M. C. Escher (lithograph, 1948) Drawing Hands, by M. C. Escher (lithograph, 1948) 12 The Leap of Faith In the combining method, we build up to a recursive procedure by writing a number of special-case nonrecursive procedures, starting

More information

Nick Montfort #! Counterpath Press, # :! :: Program : Poem

Nick Montfort #! Counterpath Press, # :! :: Program : Poem Nick Montfort #! Counterpath Press, 2014. reviewed by Afton Wilky # :! :: Program : Poem Nick Montfort s recent book, #! (pronounced Shebang), explores representation through language as an iterative system.

More information

Whitepaper. From Address

Whitepaper. From Address Whitepaper From Address The From Address Companies put a lot of effort in creating beautiful and compelling email campaigns. But when your recipients don t open the email, all the hard work that s put

More information

The architecture of Eiffel software 3.1 OVERVIEW classes clusters systems

The architecture of Eiffel software 3.1 OVERVIEW classes clusters systems 3 Draft 5.02.00-0, 15 August 2005 (Santa Barbara). Extracted from ongoing work on future third edition of Eiffel: The Language. Copyright Bertrand Meyer 1986-2005. Access restricted to purchasers of the

More information

#23: Sequences March 28, 2009

#23: Sequences March 28, 2009 #23: Sequences March 28, 2009 a mysterious rule easy peasy Suppose n is an integer, and consider this simple rule: if n is even, divide it by two; otherwise, multiply n by 3, and add one. Pretty simple,

More information

Urmas Tamm Tartu 2013

Urmas Tamm Tartu 2013 The implementation and optimization of functional languages Urmas Tamm Tartu 2013 Intro The implementation of functional programming languages, Simon L. Peyton Jones, 1987 Miranda fully lazy strict a predecessor

More information

Homework & Announcements

Homework & Announcements Homework & nnouncements New schedule on line. Reading: Chapter 18 Homework: Exercises at end Due: 11/1 Copyright c 2002 2017 UMaine School of Computing and Information S 1 / 25 COS 140: Foundations of

More information

Evaluation of Predicate Calculus By Arve Meisingset, retired research scientist from Telenor Research Oslo Norway

Evaluation of Predicate Calculus By Arve Meisingset, retired research scientist from Telenor Research Oslo Norway Evaluation of Predicate Calculus By Arve Meisingset, retired research scientist from Telenor Research 31.05.2017 Oslo Norway Predicate Calculus is a calculus on the truth-values of predicates. This usage

More information

6.001 Notes: Section 8.1

6.001 Notes: Section 8.1 6.001 Notes: Section 8.1 Slide 8.1.1 In this lecture we are going to introduce a new data type, specifically to deal with symbols. This may sound a bit odd, but if you step back, you may realize that everything

More information

Elementary Operations, Clausal Architecture, and Verb Movement

Elementary Operations, Clausal Architecture, and Verb Movement Introduction to Transformational Grammar, LINGUIST 601 October 3, 2006 Elementary Operations, Clausal Architecture, and Verb Movement 1 Elementary Operations This discussion is based on?:49-52. 1.1 Merge

More information

Software Reuse and Component-Based Software Engineering

Software Reuse and Component-Based Software Engineering Software Reuse and Component-Based Software Engineering Minsoo Ryu Hanyang University msryu@hanyang.ac.kr Contents Software Reuse Components CBSE (Component-Based Software Engineering) Domain Engineering

More information

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08025 INFORMATICS 1 - INTRODUCTION TO COMPUTATION

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08025 INFORMATICS 1 - INTRODUCTION TO COMPUTATION UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08025 INFORMATICS 1 - INTRODUCTION TO COMPUTATION Thursday 13 th December 2018 14:30 to 16:30 INSTRUCTIONS TO CANDIDATES

More information

Lecture 1: Overview

Lecture 1: Overview 15-150 Lecture 1: Overview Lecture by Stefan Muller May 21, 2018 Welcome to 15-150! Today s lecture was an overview that showed the highlights of everything you re learning this semester, which also meant

More information

CSCC24 Functional Programming Scheme Part 2

CSCC24 Functional Programming Scheme Part 2 CSCC24 Functional Programming Scheme Part 2 Carolyn MacLeod 1 winter 2012 1 Based on slides from Anya Tafliovich, and with many thanks to Gerald Penn and Prabhakar Ragde. 1 The Spirit of Lisp-like Languages

More information

Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences

Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences Towards a basic DCG for English: X-bar Theory A DCG for English using gap threading for unbounded dependencies Detmar Meurers: Intro to Computational Linguistics I OSU, LING 684.01 Generalizing over possible

More information

Minsoo Ryu. College of Information and Communications Hanyang University.

Minsoo Ryu. College of Information and Communications Hanyang University. Software Reuse and Component-Based Software Engineering Minsoo Ryu College of Information and Communications Hanyang University msryu@hanyang.ac.kr Software Reuse Contents Components CBSE (Component-Based

More information

Comp Intermediate Programming EXAM #2 March 30, 2005 Rice University - Instructors: Cox & Nguyen

Comp Intermediate Programming EXAM #2 March 30, 2005 Rice University - Instructors: Cox & Nguyen Instructions 1. This exam is conducted under the Rice Honor Code. It is a open-book exam. 2. Fill in your name on every page of the exam. 3. If you forget the name of a Java class or method, make up a

More information

collectionhq Grubby Items Refresh and Transfer Instructions

collectionhq Grubby Items Refresh and Transfer Instructions collectionhq Grubby Items Refresh and Transfer Instructions Table of Contents Topic Page Login and Landing Page 1 Scheduled Assignments 2 Collection Checks 3 Non-Fiction Collection Checks 4 Fiction Collection

More information

Repetition Through Recursion

Repetition Through Recursion Fundamentals of Computer Science I (CS151.02 2007S) Repetition Through Recursion Summary: In many algorithms, you want to do things again and again and again. For example, you might want to do something

More information

SQL Server 2005 builds on the existing strengths of SQL Server 2000 to

SQL Server 2005 builds on the existing strengths of SQL Server 2000 to In This Chapter Chapter 1 The Joy of SQL Server 2005 Programming Choosing the right SQL Server edition for your programming goals Gathering and manipulating data Enforcing business rules for your database

More information

Context-Free Grammars

Context-Free Grammars Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 3, 2012 (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b. N is a

More information

Semantics and Generative Grammar. Expanding Our Formalism, Part 2 1. These more complex functions are very awkward to write in our current notation

Semantics and Generative Grammar. Expanding Our Formalism, Part 2 1. These more complex functions are very awkward to write in our current notation Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions A Practical Concern: Most expressions of natural language will have some kind of function as their extension... These more complex

More information

Fraud Update: Why Fraudsters Love Wires and How to Stop Them. Luis Rojas, Director, Product Management WesPay 2014

Fraud Update: Why Fraudsters Love Wires and How to Stop Them. Luis Rojas, Director, Product Management WesPay 2014 Fraud Update: Why Fraudsters Love Wires and How to Stop Them Luis Rojas, Director, Product Management WesPay 2014 Competitive Pressures Drive Fraud and Operational Risk Availability Of Information Creates

More information

Handout 10: Imperative programs and the Lambda Calculus

Handout 10: Imperative programs and the Lambda Calculus 06-02552 Princ of Progr Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 10: Imperative programs and the Lambda Calculus

More information

Scribe: Virginia Williams, Sam Kim (2016), Mary Wootters (2017) Date: May 22, 2017

Scribe: Virginia Williams, Sam Kim (2016), Mary Wootters (2017) Date: May 22, 2017 CS6 Lecture 4 Greedy Algorithms Scribe: Virginia Williams, Sam Kim (26), Mary Wootters (27) Date: May 22, 27 Greedy Algorithms Suppose we want to solve a problem, and we re able to come up with some recursive

More information

Automatic generation of LL(1) parsers

Automatic generation of LL(1) parsers Automatic generation of LL(1) parsers Informatics 2A: Lecture 12 John Longley School of Informatics University of Edinburgh jrl@staffmail.ed.ac.uk 14 October, 2011 1 / 12 Generating parse tables We ve

More information

Gearing Up for Development CS130(0)

Gearing Up for Development CS130(0) Gearing Up for Development CS130(0) Development Development is a coding heavy assignment! You will need to create application using React.js (a Javascript Library). This application will display a list

More information

Mobile & More: Preparing for the Latest Design Trends

Mobile & More: Preparing for the Latest Design Trends February 26, 2015 Mobile & More: Preparing for the Latest Design Trends LATEST TRENDS Responsive Takes Over Material Is the New Flat Hero Images Getting Bigger Interactions Are Micro Video in the Background

More information

UNIVERSITY OF CALIFORNIA

UNIVERSITY OF CALIFORNIA UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division CS164 Fall 1997 P. N. Hilfinger CS 164: Midterm Name: Please do not discuss the contents of

More information

Introduction to Semantics. Expanding Our Formalism, Part 2 1

Introduction to Semantics. Expanding Our Formalism, Part 2 1 Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions As you may have guessed by this point, most expressions of natural language will have some kind of function as their extension

More information

CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L

CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L 2 0 1 5 Introduction At this point, you are ready to beginning programming at a lower level How do you actually write your

More information

Concepts of programming languages

Concepts of programming languages Concepts of programming languages Lecture 7 Wouter Swierstra 1 Last time Relating evaluation and types How to handle variable binding in embedded languages? 2 DSLs: approaches A stand-alone DSL typically

More information

Machine Learning. bad news. Big Picture: Supervised Learning. Supervised (Function) Learning. Learning From Data with Decision Trees.

Machine Learning. bad news. Big Picture: Supervised Learning. Supervised (Function) Learning. Learning From Data with Decision Trees. bad news Machine Learning Learning From Data with Decision Trees Supervised (Function) Learning y = F(x 1 x n ): true function (usually not known) D: training sample drawn from F(x) 57,M,195,0,125,95,39,25,0,1,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0

More information

CS 540-1: Introduction to Artificial Intelligence

CS 540-1: Introduction to Artificial Intelligence CS 540-1: Introduction to Artificial Intelligence Exam 1: 7:15-9:15pm, October 11, 1995 CLOSED BOOK (one page of notes allowed) Write your answers on these pages and show your work. If you feel that a

More information

School of Informatics, University of Edinburgh

School of Informatics, University of Edinburgh CS1Bh Lecture Note 1 An Overview of Algorithms The next five lectures are devoted to the study of algorithms, that is methods to solve specific problems. Other lectures in CS1Bh, further down the course,

More information

Commas Rule with some Comma Rules

Commas Rule with some Comma Rules Commas Rule with some Comma Rules Commas can be confusing. Remembering a few basic rules can help! For the best performance of this presentation, open this slideshow to fullscreen view so that all applications

More information

Hagstrom, Chapter 5 A semantics for single questions and indefinites Presented by Yağmur Sağ

Hagstrom, Chapter 5 A semantics for single questions and indefinites Presented by Yağmur Sağ Hagstrom, 1998- Chapter 5 A semantics for single questions and indefinites Presented by Yağmur Sağ I. Introduction Aim of the paper To assign a consistent semantic contribution to the -ka morpheme which

More information

CSCE 314 TAMU Fall CSCE 314: Programming Languages Dr. Flemming Andersen. Haskell Functions

CSCE 314 TAMU Fall CSCE 314: Programming Languages Dr. Flemming Andersen. Haskell Functions 1 CSCE 314: Programming Languages Dr. Flemming Andersen Haskell Functions 2 Outline Defining Functions List Comprehensions Recursion 3 Conditional Expressions As in most programming languages, functions

More information

The 21 WORD . That Can Get You More Clients. Ian Brodie

The 21 WORD  . That Can Get You More Clients. Ian Brodie The 21 WORD EMAIL That Can Get You More Clients Ian Brodie The 21 Word Email That Can Get You More Clients Hey there! Welcome to this short report on the 21 Word Email That Can Get You More Clients If

More information

b. How many bits are there in the physical address?

b. How many bits are there in the physical address? Memory Management 1) Consider a logical address space of 64 (or 26) pages of 1,024 (or 210) bytes each, mapped onto a physical memory of 32 (or 25) frames. a. How many bits are there in the logical address?

More information

Context-Free Grammars

Context-Free Grammars Context-Free Grammars Carl Pollard yntax 2 (Linguistics 602.02) January 3, 2012 Context-Free Grammars (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b.

More information

Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009

Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009 Context-Free Grammars Carl Pollard Ohio State University Linguistics 680 Formal Foundations Tuesday, November 10, 2009 These slides are available at: http://www.ling.osu.edu/ scott/680 1 (1) Context-Free

More information

B.A.B.E. Framework. Business Audience Brand Everything Digital Website Blogging Social

B.A.B.E. Framework. Business Audience Brand Everything Digital  Website Blogging Social EMAIL MARKETING B.A.B.E. Framework Business Audience Brand Everything Digital Email Website Blogging Social What is my digital strategy? You can t just launch a website and hope to have clients the next

More information

Formal Languages and Compilers Lecture I: Introduction to Compilers

Formal Languages and Compilers Lecture I: Introduction to Compilers Formal Languages and Compilers Lecture I: Introduction to Compilers Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/

More information

(a) Turing test: a test designed to indicate whether or not a system can be said to be intelligent. If a computer

(a) Turing test: a test designed to indicate whether or not a system can be said to be intelligent. If a computer CS188 Intro to AI Spring 1993 Stuart Russell Final solutions 1. (12 pts.) Denitions Provide brief, precise denitions of the following: (a) Turing test: a test designed to indicate whether or not a system

More information

Richard Feynman, Lectures on Computation

Richard Feynman, Lectures on Computation Chapter 8 Sorting and Sequencing If you keep proving stuff that others have done, getting confidence, increasing the complexities of your solutions for the fun of it then one day you ll turn around and

More information

CS 61C: Great Ideas in Computer Architecture. MIPS Instruction Formats

CS 61C: Great Ideas in Computer Architecture. MIPS Instruction Formats CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats Instructor: Justin Hsia 6/27/2012 Summer 2012 Lecture #7 1 Review of Last Lecture New registers: $a0-$a3, $v0-$v1, $ra, $sp Also: $at,

More information

Conformance. Object-Oriented Programming Spring 2015

Conformance. Object-Oriented Programming Spring 2015 Conformance Object-Oriented Programming 236703 Spring 2015 1 What s Conformance? Overriding: replace method body in sub-class Polymorphism: subclass is usable wherever superclass is usable Dynamic Binding:

More information

PAIRS AND LISTS 6. GEORGE WANG Department of Electrical Engineering and Computer Sciences University of California, Berkeley

PAIRS AND LISTS 6. GEORGE WANG Department of Electrical Engineering and Computer Sciences University of California, Berkeley PAIRS AND LISTS 6 GEORGE WANG gswang.cs61a@gmail.com Department of Electrical Engineering and Computer Sciences University of California, Berkeley June 29, 2010 1 Pairs 1.1 Overview To represent data types

More information

Analysis of Algorithms

Analysis of Algorithms ITP21 - Foundations of IT 1 Analysis of Algorithms Analysis of algorithms Analysis of algorithms is concerned with quantifying the efficiency of algorithms. The analysis may consider a variety of situations:

More information

Algorithm classification

Algorithm classification Types of Algorithms Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We ll talk about a classification scheme for algorithms This classification scheme

More information

Course Overview. Introduction (Chapter 1) Compiler Frontend: Today. Compiler Backend:

Course Overview. Introduction (Chapter 1) Compiler Frontend: Today. Compiler Backend: Course Overview Introduction (Chapter 1) Compiler Frontend: Today Lexical Analysis & Parsing (Chapter 2,3,4) Semantic Analysis (Chapter 5) Activation Records (Chapter 6) Translation to Intermediate Code

More information

Become a Champion Data Modeler with SQL Developer Data Modeler 3.0

Become a Champion Data Modeler with SQL Developer Data Modeler 3.0 Become a Champion Data Modeler with SQL Developer Data Modeler 3.0 Marc de Oliveira, Simplify Systems Introduction This presentation will show you how I think good data models are made, and how SQL Developer

More information

Organizing your Outlook Inbox

Organizing your Outlook Inbox Organizing your Outlook Inbox Tip 1: Filing system Tip 2: Create and name folders Tip 3: Folder structures Tip 4: Automatically organizing incoming emails into folders Tip 5: Using Colors Tip 6: Using

More information

Chapter 13: Reference. Why reference Typing Evaluation Store Typings Safety Notes

Chapter 13: Reference. Why reference Typing Evaluation Store Typings Safety Notes Chapter 13: Reference Why reference Typing Evaluation Store Typings Safety Notes References Computational Effects Also known as side effects. A function or expression is said to have a side effect if,

More information

Pootle Tutorial! Guide for translators and developers!

Pootle Tutorial! Guide for translators and developers! Pootle Tutorial Guide for translators and developers + Copyright 2014 Contents 1 Setting up an existing project 3 1.1 Adding the source language (the template ) 4 1.2 Localizing a project in a specific

More information

CSCI0330 Intro Computer Systems Doeppner. Lab 02 - Tools Lab. Due: Sunday, September 23, 2018 at 6:00 PM. 1 Introduction 0.

CSCI0330 Intro Computer Systems Doeppner. Lab 02 - Tools Lab. Due: Sunday, September 23, 2018 at 6:00 PM. 1 Introduction 0. CSCI0330 Intro Computer Systems Doeppner Lab 02 - Tools Lab Due: Sunday, September 23, 2018 at 6:00 PM 1 Introduction 0 2 Assignment 0 3 gdb 1 3.1 Setting a Breakpoint 2 3.2 Setting a Watchpoint on Local

More information

ProgressTestA Unit 5. Vocabulary. Grammar

ProgressTestA Unit 5. Vocabulary. Grammar ProgressTestA Unit Vocabulary 1 Completethesentenceswithappropriate words.thefirstlettersofthewordshavebeen given. a Can you believe it? She s getting married to a man she has met on a s networking site!

More information

COMP 410 Lecture 1. Kyle Dewey

COMP 410 Lecture 1. Kyle Dewey COMP 410 Lecture 1 Kyle Dewey About Me I research automated testing techniques and their intersection with CS education My dissertation used logic programming extensively This is my second semester at

More information

5 The Control Structure Diagram (CSD)

5 The Control Structure Diagram (CSD) 5 The Control Structure Diagram (CSD) The Control Structure Diagram (CSD) is an algorithmic level diagram intended to improve the comprehensibility of source code by clearly depicting control constructs,

More information