PPT-CMSC 330: Organization of Programming Languages

Functional Programming with OCaml CMSC 330 2 Review Recursion is how all looping is done OCaml can easily pass and return functions CMSC 330 3 The Call Stack in CJavaetc void fvoid int x. System fault A characteristic of a software system that can lead to a system error For example failure to initialize a variable could lead to that variable having the wrong value when it is used Human error or mistake Human behavior that results in Lecture 18. Static vs. Dynamic Typing. Dan Grossman. Fall 2011. Static vs. dynamic typing. A big, juicy, essential, topic about how to think about PLs. Conversation usually overrun with half-informed opinions . Context-Free . Grammars. Ambiguity . CMSC 330. 2. Review. Why should we study CFGs?. What are the four parts of a CFG?. How do we tell if a string is accepted by a CFG?. What. ’. s a parse tree?. CMSC 330. Chapter One. Modern Programming Languages, 2nd ed. . 1. Outline. What makes programming languages an interesting subject? . The amazing variety. The odd controversies. The intriguing evolution. The connection to programming practice. Introduction To Ruby; Dynamic OOP; "Duck Typing". Alan Borning. Autumn 2012. (slides borrowed from Dan Grossman). The plan. Lecture materials may not recount every little language feature we use. Thomas book . CS 170b. Benjamin Gaska, much help from William Mitchell. What is a programming language. A simple definition:. A system for describing computation.. It is generally agreed that in order for a language to be . 1. A Type Is A Set. When you declare that a variable has a certain type, you are saying that the values the variable can have are elements of a certain set. A type is a set of values. plus a low-level representation. Lecture . 9. Function-Closure Idioms. Zach Tatlock. Winter 2018. More idioms. We know the rule for lexical scope and function closures. Now what is it good for. A partial but wide-ranging list:. Pass functions with private data to iterators: Done. 13. Learning Objectives. Define programming of and describe the six steps of . programming.. Compare . design tools including top-down design, pseudocode, flowcharts, and logic . structures.. Describe program testing and the tools for finding and removing . Lecture 14. Thunks. , Laziness, Streams, . Memoization. Dan Grossman. Winter 2013. Delayed evaluation. For each language construct, the semantics specifies when . subexpressions. get evaluated. In ML, Racket, Java, C:. Lecture 17. Implementing Languages Including Closures. Dan Grossman. Autumn . 2018. Typical workflow. Autumn 2018. 2. CSE341: Programming Languages. "(. fn. x => x x) 4". Parsing. Call. Function. Lecture 18. Static vs. Dynamic Typing. Dan Grossman. Autumn . 2018. Key differences. Racket and ML have . much. . . in common. Key differences. Syntax. Pattern-matching vs. . struct. -tests and . accessor. Lecture 17. Implementing Languages Including Closures. Dan Grossman. Spring 2013. Typical workflow. Spring 2013. 2. CSE341: Programming Languages. "(. fn. x => x + x) 4". Parsing. Call. Function. Lecture . 22. OOP . vs. Functional Decomposition; Adding Operators & Variants; . Double-Dispatch . Dan Grossman. Winter 2013. Breaking things down. In functional (and procedural) programming, break programs down into .