DOCSLIB.ORG

Lua Introduction • Lua History • Lua Features Lua Foundation of Pls

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lua Introduction • Lua History • Lua Features Lua Foundation of Pls Outline • Lua Introduction • Lua History • Lua Features Lua Foundation of PLs Yu Zhang Acknowledgement: Stanford CS242: Programming Languages, http://cs242.stanford.edu/ Course web site: http://staff.ustc.edu.cn/~yuzhang/fopl FOPL: Lua 2 What is a scripting language? Scripting langs: so productive • Common features of a scripting language • Key idea: encode program information as you go – Dynamically typed – e.g. type information, data lifetime – Garbage collected – No one likes commitment! – Rich standard library – Reflection/metaprogramming • Easy to use certain idioms hard to express in static types – Interfaces/duck typing – Polymorphism – Heterogeneous data structures – Extensible classes FOPL: Lua 3 FOPL: Lua 4 Script. langs: semi-specialized Why Lua? • Bash-like scripting languages • Simplest, cleanest scripting language still in use – e.g. Python, Perl • “Correct” scoping – For file manipulation,data crunching, command line parsing • No class system (but can build our own!) • Web scripting languages • Easy to learn in a day – e.g. JavaScript, PHP – Specialized constructs for dealing with webpages or HTTP requests • Born in 1993 at PUC-Rio, Brazil • Embedded scripting languages • https://www.lua.org/pil/ – Mostly just Lua • Data structure: tables (associative arrays) – Lightweight, easy to build, simple semantics for games, config • Coroutines, extensible semantics, embedding files The Evolution of Lua, HOPL III, Jun 9-10, 2007. FOPL: Lua 5 FOPL: Lua 6 1 Lua: Overview Lua Implementation • Lua function • https://www.lua.org/download.html -- Recursive impl. -- Iterative impl. – Lua 5.3: Jan 12, 2015, Lua 5.3.5: Jul 10, 2018 function fact(n) function fact(n) if n == 0 then local a = 1 – Smallish, e.g. Lua 5.1 17000 lines of C return 1 for i = 1, n do else a = a * i – Portable return n * fact(n-1) end end return a – Embeddable end end • can call Lua from C and C from Lua • C – Clean code -- Recursive impl. -- Iterative impl. int fact(int n) { int fact(int n){ • Good for your “code reading club” if (n == 0) int a = 1, i; – Efficiency return 1; for (i = 1; i<n; i++) else a = a * i; • Fast for an interpreted scripting language: lang. simplicity helps return n * fact(n-1); return a; • Presently has a register based VM, pre-compilation supported } } FOPL: Lua 7 FOPL: Lua 8 Lua vs. Modula Syntax Lua: similarities with Scheme • Designed for productive use “The influence of Scheme has gradually increased during Lua’s evolution.” – “Syntactically, Lua is reminiscent of Modula and uses • Simiarities familiar keywords.” [HOPL] – Dynamic typing, first-class values, anonymous functions, closures, ... -- Lua -- Modula-2 function fact(n) PROCEDURE Fact(n: CARDINAL): • would have wanted first-class continuations CARDINAL; • function foo() ... end is syntactic sugar for foo = function () ... end local a = 1 VAR a: CARDINAL; BEGIN a := 1 – Scheme has lists as its data structuring mechanism, for i = 1, n do FOR i := 1 TO n DO while Lua has tables. a = a * i a := a * i; end END; – No particular object or class model forced onto the return a RETURN a; programmer—choose or implement one yourself. end END Fact; FOPL: Lua 9 FOPL: Lua 10 Lua History SOL • Prehistory • SOL as in "Simple Object Language" – Born in 1993 inside Tecgraf – a DSL for a configurable report generator for lithology (Comp. Graphics Tech. Group of PUC-Rio in Brazil) profiles – Lua creators: Roberto Ierusalimschy, Luiz Henrique de • SOL interpreter Figueiredo, and Waldemar Celes – read a report description, and syntax and type check – Lua Ancestors: “These languages, called DEL and specified objects and attributes SOL, were the ancestors of Lua.” • syntax influenced by BibTeX • DEL and SOL were domain-specific languages (DSLs) for Tecgraf-developed interactive graphical programs type @track{ x:number, y:number=23, id=0 } – DEL as in "data-entry language“ type @line{ t:@track=@track{x=8}, z:number* } • for describing data-entry tasks: named and typed fields, T = @track{ y=9, x=10, id="1992-34" } data validation rules, how to input and output data L = @line{ t=@track{x=T.y, y=T.x}, z=[2,3,4] } FOPL: Lua 11 FOPL: Lua 12 2 Motivation for Lua Birth of Lua – DEL users began to ask for more power, e.g. control flow • "Lua"—"moon" in Portuguese (with conditionals and loops) – cf. "SOL"—"sun" in Portuguese – SOL implementation finished, but not delivered, as • SOL’s syntax for record and list construction support for procedural programming was soon to be required T = @track{ y=9, x=10, id="1992-34" } – Conclusion: replace both SOL and DEL by a single, valid in both SOL and Lua. more powerful language • Semantics differ: • Existing Alternatives – tables represent both records and lists; – Tcl: "unfamiliar syntax", bad data description support, – track (here) does not name a record type, it names a Unix only function to be applied. No match for the free, – Lisps: "unfriendly syntax" do-it-yourself atmosphere at Tecgraf – Python: still in its infancy FOPL: Lua 13 FOPL: Lua 14 Lua Feature Evolution Lua Types • Lua designers have shown good judgement. • Lua’s type selection has remained fairly stable. • Learn PL design by asking: – initially: numbers, strings, tables, nil, userdata (pointers to C objects), Lua functions, C functions – What features were added to Lua and why? – unified functions in v3.0; booleans and threads in v5.0 – What features were turned down and why? • Learn PL implementation by asking: • Tables: any value as index – early syntax: @(), @[1,2], @{x=1,y=2} – How were the features implemented? – later syntax: {}, {1,2}, {x=1,y=2}, {1,2,x=1,y=2} – What kind of implementations were not possible due to • sparse arrays OK: {[1000000000]=1} – other implementation choices? – element referencing sugar: a.x for a["x"] – tables with named functions for OO • for inheritance, define a table indexing operation FOPL: Lua 15 FOPL: Lua 16 Tables Extensible Semantics • The syntax of tables has evolved, the semantics of • Goals tables in Lua has not changed at all: – allow tables to be used as a basis for objects and classes – tables are still associative arrays and can store arbitrary • fallbacks in Lua 2.1(备选) pairs of values – One function per operation (table indexing, arithmetic • Effort in implementing tables efficiently operations, string concatenation, order comparisons, and – Lua 4.0, tables were implemented as pure hash tables, function calls) 当操作被应用到错误的值时，调用备选函数 with all pairs stored explicitly • tag methods in Lua 3.0 – Lua 5.0, a hybrid representation for tables: every table – tag-specific fallbacks, any value taggable contains a hash part and an array part, and both parts • metatables and metamethods in Lua 5.0 can be empty. Tables automatically adapt their two parts x = {} according to their contents. function f () return -5 end setmetatable(x, { __unm = f }) return -x --> -5 FOPL: Lua 17 FOPL: Lua 18 3 Expressing OOP Concepts Expressing OOP Concepts FOPL: Lua 19 FOPL: Lua 20 Expressing OOP Concepts Use metatables to add a layer of Overhead issue! indirection and to provide dynamic lookup on the metatable. According to the definition, each A group of related tables may share a instance of an account contains common metatable (which describes an entry for every method their common behavior). member, which leads to a lot of Line 3 creates object if user does not provide one; line 4 calls setmetatable pointers, and a lot of overhead. to set or change the metatable of any new object t, and make t inherit its Assume you have a class with 30 operations from the A table itself methods, then every time you using the index metamethod, accordingly reducing the overhead make an instance of the class, mentioned before. you have to allocate 30 strings and store them all in a table. FOPL: Lua 21 FOPL: Lua 22 Expressing OOP Concepts The derived class LA is just an Scope, Function Calls and instance of A but extended with member l. Storage Management LA inherits new from A. When new at line 20 executes, the self parameter will refer to LA. Therefore, value at “ConceptsinProgrammingLanguages” index index in the metatable of a will Chapter7:Scope,Functions,andStorage be LA. Thus a inherits from LA, which Management inherits from A. When calling a:w at line 21, Lua cannot find a w field in a, so it looks into LA and there it finds the implementation for LA:w. FOPL: Lua 23 4 Scope Simplified Machine Model • Nested blocks, local variables • Storage management – Enter block: allocate space for variables – Exits block: some or all space may be deallocated • Static (lexical) scoping (Lua, etc.) – Global refers to declaration in closest enclosing block • Dynamic scoping – Global refers to most recent activation record FOPL: Lua 25 FOPL: Lua 26 Activation record for in-link block Activation record for function • Control link • Return address – Pointer to previous record on – Location of code to execute stack on function return • Push record on stack • Return-result address – Set new control link to point to – Address in activation record old env ptr of calling block to store – Set env ptr to new record function return val • Pop record off stack • Parameters – Follow control link of current – Locations to contain data record to reset environment from calling block pointer FOPL: Lua 27 FOPL: Lua 28 First-order functions Activation record for static scope • Parameter passing • Control link – pass-by-value: copy value to new activation record – Link to activation record of previous (calling) block – pass-by-reference: copy ptr to new activation record • Access link – Link to activation record
Load more

Recommended publications
  • Bringing GNU Emacs to Native Code
    Bringing GNU Emacs to Native Code Andrea Corallo Luca Nassi Nicola Manca [email protected] [email protected] [email protected] CNR-SPIN Genoa, Italy ABSTRACT such a long-standing project. Although this makes it didactic, some Emacs Lisp (Elisp) is the Lisp dialect used by the Emacs text editor limitations prevent the current implementation of Emacs Lisp to family. GNU Emacs can currently execute Elisp code either inter- be appealing for broader use. In this context, performance issues preted or byte-interpreted after it has been compiled to byte-code. represent the main bottleneck, which can be broken down in three In this work we discuss the implementation of an optimizing com- main sub-problems: piler approach for Elisp targeting native code. The native compiler • lack of true multi-threading support, employs the byte-compiler’s internal representation as input and • garbage collection speed, exploits libgccjit to achieve code generation using the GNU Com- • code execution speed. piler Collection (GCC) infrastructure. Generated executables are From now on we will focus on the last of these issues, which con- stored as binary files and can be loaded and unloaded dynamically. stitutes the topic of this work. Most of the functionality of the compiler is written in Elisp itself, The current implementation traditionally approaches the prob- including several optimization passes, paired with a C back-end lem of code execution speed in two ways: to interface with the GNU Emacs core and libgccjit. Though still a work in progress, our implementation is able to bootstrap a func- • Implementing a large number of performance-sensitive prim- tional Emacs and compile all lexically scoped Elisp files, including itive functions (also known as subr) in C.
    [Show full text]
  • Hop Client-Side Compilation
    Chapter 1 Hop Client-Side Compilation Florian Loitsch1, Manuel Serrano1 Abstract: Hop is a new language for programming interactive Web applications. It aims to replace HTML, JavaScript, and server-side scripting languages (such as PHP, JSP) with a unique language that is used for client-side interactions and server-side computations. A Hop execution platform is made of two compilers: one that compiles the code executed by the server, and one that compiles the code executed by the client. This paper presents the latter. In order to ensure compatibility of Hop graphical user interfaces with popular plain Web browsers, the client-side Hop compiler has to generate regular HTML and JavaScript code. The generated code runs roughly at the same speed as hand- written code. Since the Hop language is built on top of the Scheme program- ming language, compiling Hop to JavaScript is nearly equivalent to compiling Scheme to JavaScript. SCM2JS, the compiler we have designed, supports the whole Scheme core language. In particular, it features proper tail recursion. How- ever complete proper tail recursion may slow down the generated code. Despite an optimization which eliminates up to 40% of instrumentation for tail call in- tensive benchmarks, worst case programs were more than two times slower. As a result Hop only uses a weaker form of tail-call optimization which simplifies recursive tail-calls to while-loops. The techniques presented in this paper can be applied to most strict functional languages such as ML and Lisp. SCM2JS can be downloaded at http://www-sop.inria.fr/mimosa/person- nel/Florian.Loitsch/scheme2js/.
    [Show full text]
  • SI 413, Unit 3: Advanced Scheme
    SI 413, Unit 3: Advanced Scheme Daniel S. Roche ([email protected]) Fall 2018 1 Pure Functional Programming Readings for this section: PLP, Sections 10.7 and 10.8 Remember there are two important characteristics of a “pure” functional programming language: • Referential Transparency. This fancy term just means that, for any expression in our program, the result of evaluating it will always be the same. In fact, any referentially transparent expression could be replaced with its value (that is, the result of evaluating it) without changing the program whatsoever. Notice that imperative programming is about as far away from this as possible. For example, consider the C++ for loop: for ( int i = 0; i < 10;++i) { /∗ some s t u f f ∗/ } What can we say about the “stuff” in the body of the loop? Well, it had better not be referentially transparent. If it is, then there’s no point in running over it 10 times! • Functions are First Class. Another way of saying this is that functions are data, just like any number or list. Functions are values, in fact! The specific privileges that a function earns by virtue of being first class include: 1) Functions can be given names. This is not a big deal; we can name functions in pretty much every programming language. In Scheme this just means we can do (define (f x) (∗ x 3 ) ) 2) Functions can be arguments to other functions. This is what you started to get into at the end of Lab 2. For starters, there’s the basic predicate procedure?: (procedure? +) ; #t (procedure? 10) ; #f (procedure? procedure?) ; #t 1 And then there are “higher-order functions” like map and apply: (apply max (list 5 3 10 4)) ; 10 (map sqrt (list 16 9 64)) ; '(4 3 8) What makes the functions “higher-order” is that one of their arguments is itself another function.
    [Show full text]
  • Supporting Return-Value Optimisation in Coroutines
    Document P1663R0 Reply To Lewis Baker <[email protected]> Date 2019-06-18 Audience Evolution Supporting return-value optimisation in coroutines Abstract 2 Background 3 Motivation 4 RVO for coroutines and co_await expressions 6 Return-Value Optimisation for normal functions 6 Return-Value Optimisation for co_await expressions 8 Status Quo 8 Passing a handle to the return-value slot 8 Resuming with an exception 10 Multiple Resumption Paths and Symmetric Transfer 10 Simplifying the Awaiter concept 11 Specifying the return-type of an awaitable 12 Calculating the address of the return-value 12 Benefits and Implications of RVO-style awaitables 14 Generalising set_exception() to set_error<E>() 17 Avoiding copies when returning a temporary 17 A library solution to avoiding construction of temporaries 19 Language support for avoiding construction of temporaries 21 Avoiding copies for nested calls 22 Adding support for this incrementally 23 Conclusion 24 Acknowledgements 24 Appendix - Examples 25 Abstract Note that this paper is intended to motivate the adoption of changes described in P1745R0 for C++20 to allow adding support for async RVO in a future version of C++. The changes described in this paper can be added incrementally post-C++20. The current design of the coroutines language feature defines the lowering of a co_await expression ​ ​ such that the result of the expression is produced by a call to the await_resume() method on the ​ ​ awaiter object. This design means that a producer that asynchronously produces a value needs to store the value somewhere before calling .resume() so that the await_resume() method can then return that ​ ​ ​ ​ value.
    [Show full text]
  • A History of Clojure
    A History of Clojure RICH HICKEY, Cognitect, Inc., USA Shepherd: Mira Mezini, Technische Universität Darmstadt, Germany Clojure was designed to be a general-purpose, practical functional language, suitable for use by professionals wherever its host language, e.g., Java, would be. Initially designed in 2005 and released in 2007, Clojure is a dialect of Lisp, but is not a direct descendant of any prior Lisp. It complements programming with pure functions of immutable data with concurrency-safe state management constructs that support writing correct multithreaded programs without the complexity of mutex locks. Clojure is intentionally hosted, in that it compiles to and runs on the runtime of another language, such as the JVM. This is more than an implementation strategy; numerous features ensure that programs written in Clojure can leverage and interoperate with the libraries of the host language directly and efficiently. In spite of combining two (at the time) rather unpopular ideas, functional programming and Lisp, Clojure has since seen adoption in industries as diverse as finance, climate science, retail, databases, analytics, publishing, healthcare, advertising and genomics, and by consultancies and startups worldwide, much to the career-altering surprise of its author. Most of the ideas in Clojure were not novel, but their combination puts Clojure in a unique spot in language design (functional, hosted, Lisp). This paper recounts the motivation behind the initial development of Clojure and the rationale for various design decisions and language constructs. It then covers its evolution subsequent to release and adoption. CCS Concepts: • Software and its engineering ! General programming languages; • Social and pro- fessional topics ! History of programming languages.
    [Show full text]
  • Tail Recursion • Natural Recursion with Immutable Data Can Be Space- Inefficient Compared to Loop Iteration with Mutable Data
    CS 251 SpringFall 2019 2020 Principles of of Programming Programming Languages Languages Ben Wood Topics λ Ben Wood Recursion is an elegant and natural match for many computations and data structures. Tail Recursion • Natural recursion with immutable data can be space- inefficient compared to loop iteration with mutable data. • Tail recursion eliminates the space inefficiency with a +tail.rkt simple, general pattern. • Recursion over immutable data expresses iteration more clearly than loop iteration with mutable state. • More higher-order patterns: fold https://cs.wellesley.edu/~cs251/s20/ Tail Recursion 1 Tail Recursion 2 Naturally recursive factorial CS 240-style machine model Registers Code Stack (define (fact n) Call frame (if (= n 0) 1 Call frame (* n (fact (- n 1))))) Call frame Heap arguments, variables, fixed size, general purpose general size, fixed return address per function call Space: O( ) Program How efficient is this implementation? Counter cons cells, Time: O( ) Stack data structures, … Pointer Tail Recursion 3 Tail Recursion 4 Evaluation (define (fact n) (if (= n 0) Naturally recursive factorial example 1 (* n (fact (- n 1))))) Call stacks at each step (fact 3) (fact 3): 3*_ (fact 3): 3*_ (fact 3): 3*_ (define (fact n) (fact 2) (fact 2): 2*_ (fact 2): 2*_ (if (= n 0) Compute result so far Base case returns 1 after/from recursive call. (fact 1) (fact 1): 1*_ base result. Remember: n ↦ 2; and (* n (fact (- n 1))))) “rest of function” for this call. (fact 0) Recursive case returns result so far. Compute remaining argument before/for recursive call. (fact 3): 3*_ (fact 3): 3*_ (fact 3): 3*_ (fact 3): 3*2 (fact 2): 2*_ (fact 2): 2*_ (fact 2): 2*1 Space: O( ) (fact 1): 1*_ (fact 1): 1*1 Time: O( ) (fact 0): 1 Tail Recursion 5 Tail Recursion 6 Tail recursive factorial Common patterns of work Accumulator parameter Natural recursion: Tail recursion: provides result so far.
    [Show full text]
  • Interprocedural Control Flow Analysis of First-Order Programs with Tail Call Optimization 1 Introduction
    Interpro cedural Control Flow Analysis of FirstOrder Programs with Tail Call Optimization Saumya K Debray and To dd A Pro ebsting Department of Computer Science The University of Arizona Tucson AZ USA Email fdebray toddgcsarizonaedu Decemb er Abstract The analysis of control ow Involves guring out where returns will go How this may b e done With items LR and Is what in this pap er we show Intro duction Most co de optimizations dep end on control ow analysis typically expressed in the form of a control ow graph Traditional algorithms construct intrapro cedural ow graphs which do not account for control ow b etween pro cedures Optimizations that dep end on this limited information cannot consider the b e havior of other pro cedures Interpro cedural versions of these optimizations must capture the ow of control across pro cedure b oundaries Determining interpro cedural control ow for rstorder programs is relatively straightforward in the absence of tail call optimization since pro cedures return control to the p oint imme diately after the call Tail call optimization complicates the analysis b ecause returns may transfer control to a pro cedure other than the active pro cedures caller The problem can b e illustrated by the following simple program that tak es a list of values and prints in their original order all the values that satisfy some prop erty eg exceed To take advantage of tailcall optimization it uses an accumulator to collect these values as it traverses the input list However this causes the order of the values in the
    [Show full text]
  • Principles of Programming Languages from Recursion to Iteration Through CPS
    Principles of Programming Languages From Recursion to Iteration Through CPS 1/71 The Problem We’re Solving Today We observed in a previous lecture that with our L5 interpreter because it is executed in a JavaScript interpreter which does NOT implement Tail Call Optimization, we run out of stack space even when we execute a tail-recursive function in L5. 2/71 The Problem We’re Solving Today In this section, we introduce a general method which models recursion explicitly - so that we can properly implement tail-recursion as iteration even when our meta-language does not support tail call optimization. In other words, our implementer explains how to turn tail recursion into iteration. 3/71 The Problem We’re Solving Today We first illustrate the general approach ona concrete example (a simple tail recursive function written in TypeScript, which we turn into an equivalent iterative program in JavaScript through gradual semantic transformations). 4/71 The Problem We’re Solving Today We then implement the same method on the L5 interpreter and obtain an iterative version of the interpreter. We finally demonstrate that when we execute the iterative interpreter on a tail-recursive L5 program, this yields an iterative execution process which does not consume control memory. 5/71 The Problem We’re Solving Today The end-result is an interpreter which executes tail-recursive programs as iteration even though the meta-language does not implement tail recursion optimization. 6/71 From Recursion to Tail Recursion Using the CPS Transformation Consider the following recursive function in TypeScript: const sum = (n: number): number => (n === 0) ? 0 : n + sum(n - 1); 7/71 From Recursion to Tail Recursion Using the CPS Transformation This function is recursive (because the recursive call does not appear in tail position).
    [Show full text]
  • A Modern Reversible Programming Language April 10, 2015
    Arrow: A Modern Reversible Programming Language Author: Advisor: Eli Rose Bob Geitz Abstract Reversible programming languages are those whose programs can be run backwards as well as forwards. This condition impacts even the most basic constructs, such as =, if and while. I discuss Janus, the first im- perative reversible programming language, and its limitations. I then introduce Arrow, a reversible language with modern features, including functions. Example programs are provided. April 10, 2015 Introduction: Many processes in the world have the property of reversibility. To start washing your hands, you turn the knob to the right, and the water starts to flow; the process can be undone, and the water turned off, by turning the knob to the left. To turn your computer on, you press the power button; this too can be undone, by again pressing the power button. In each situation, we had a process (turning the knob, pressing the power button) and a rule that told us how to \undo" that process (turning the knob the other way, and pressing the power button again). Call the second two the inverses of the first two. By a reversible process, I mean a process that has an inverse. Consider two billiard balls, with certain positions and velocities such that they are about to collide. The collision is produced by moving the balls accord- ing to the laws of physics for a few seconds. Take that as our process. It turns out that we can find an inverse for this process { a set of rules to follow which will undo the collision and restore the balls to their original states1.
    [Show full text]
  • Proper Tail Recursion and Space Efficiency
    Proper Tail Recursion and Space Efficiency William D Clinger Northeastern University [email protected] Abstract E ..- (quote c> constants The IEEE/ANSI standard for Scheme requires implementa- I variable references tions to be properly tail recursive. This ensures that portable L lambda expressions code can rely upon the space efficiency of continuation-pass- (if EO El E2) conditional expressions ing style and other idioms. On its face, proper tail recursion I (set! I Eo) assignments concerns the efficiency of procedure calls that occur within (Eo El . ..I procedure calls ..- a tail context. When examined closely, proper tail recur- L ..-’ (lambda (11 . > E) sion also depends upon the fact that garbage collection can TRUE 1 FALSE 1 NUM:z 1 SYM:I be asymptotically more space-efficient than Algol-like stack v$E&3;. .) I * * * allocation. Proper tail recursion is not the same as ad hoc tail call Location optimization in stack-based languages. Proper tail recursion Identifier often precludes stack allocation of variables, but yields a well-defined asymptotic space complexity that can be relied upon by portable programs. Figure 1: Internal syntax of Core Scheme. This paper offers a formal and implementation-indepen- dent definition of proper tail recursion for Scheme. It also shows how an entire family of reference implementations can execution of an iterative computation in constant be used to characterize related safe-for-space properties, and space, even if the iterative computation is de- proves the asymptotic inequalities that hold between them. scribed by a syntactically recursive procedure. The standard’s citation refers to a technical report that uses 1 Introduction CPS-conversion to explain what proper tail recursion meant in the context of the first Scheme compiler [Ste78].
    [Show full text]
  • CS 137 Part 9 Fibonacci, More on Tail Recursion, Map and Filter Fibonacci Numbers
    CS 137 Part 9 Fibonacci, More on Tail Recursion, Map and Filter Fibonacci Numbers • An ubiquitous sequence named after Leonardo de Pisa (circa 1200) defined by 8 0 if n == 0 <> fib(n) = 1 if n == 1 > :fib(n-1) + fib(n-2) otherwise Examples in Nature • Plants, Pinecones, Sunflowers, • Rabbits, Golden Spiral and Ratio connections • Tool's song Lateralus • https://www.youtube.com/watch?v=wS7CZIJVxFY Fibonacci First Attempt #include <stdio.h> int fib (int n){ if (n == 0) return 0; if (n == 1) return 1; return fib(n-1)+fib(n-2); } int main () { printf("%d\n",fib(3)); printf("%d\n",fib(10)); //f_45 is largest that fits in integer. printf("%d\n",fib(45)); return 0; } Fibonacci Call Tree Fibonacci Call Tree • The tree is really large, containing O(2n) many nodes (Actually grows with φn where φ is the golden ratio (1.618) ) • Number of fib(1) leaves is fib(n) • Summing these is O(fib(n)) • Thus, the code on the previous slide runs in O(fib(n)) which is exponential! Improvements • This implementation of Fibonacci shouldn't take this long - After all, by hand you could certainly compute more than fib(45). • We could change the code so that we're no longer calling the stack each time, rather we're using iterative structures. • This would reduce the runtime to O(n). Iterative Fibonacci int fib(int n){ if(n==0) return 0; int prev = 0, cur = 1; for(int i=2; i<n; i++){ int next = prev + cur; prev = cur ; cur = next ; } return cur; } Trace n prev cur next 1 0 1 2 1 1 1 3 1 2 2 4 2 3 3 5 3 5 5 Tail Recursive Fibonacci int fib_tr(int prev, int cur, int n){ if(n==0) return cur; return fib_tr(cur, prev + cur, n-1); } int fib(int n){ if(n==0) return 0; return fib_tr(0,1,n-1); } Picture Tail Call Elimination Tail call elimination can reuse the activation record for each instance of fib tr().
    [Show full text]
  • CS 321 Programming Languages Forward Recursion Functions Calls
    tally [] y0 tally [] y0 tally [8] y8+0 tally [8] y8+0 tally [6;8] y6+8 tally [6;8] y6+8 tally [2;6;8] y2+14 y2+14 y4+16 y4+16 20 20 Forward recursion CS 321 Programming Languages In forward recursion, you first call the function recursively on all Intro to OCaml – Recursion (tail vs forward) the recursive components, and then build the final result from the partial results. Baris Aktemur Wait until the whole structure has been traversed to start building Ozye˘ginUniversity¨ the answer. th # let rec tally lst= Last update made on Thursday 12 October, 2017 at 11:25. match lst with |[] ->0 |x::xs ->x+ tally xs;; Much of the contents here are taken from Elsa Gunter and Sam # let rec squareUp lst= Kamin’s OCaml notes available at match lst with http://courses.engr.illinois.edu/cs421 |[] ->[] |x::xs ->(x*x)::squareUp xs;; Ozye˘gin¨ University — CS 321 Programming Languages 1 Ozye˘gin¨ University — CS 321 Programming Languages 2 Functions calls and the stack Functions calls and the stack tally [2;6;8] tally [4;2;6;8] tally [4;2;6;8] Ozye˘gin¨ University — CS 321 Programming Languages 3 Ozye˘gin¨ University — CS 321 Programming Languages 3 tally [] y0 tally [] y0 tally [8] y8+0 y8+0 y6+8 y6+8 y2+14 y2+14 y4+16 y4+16 20 20 y0 y8+0 y8+0 y6+8 y6+8 y2+14 y2+14 y4+16 y4+16 20 20 Functions calls and the stack Functions calls and the stack tally [8] tally [6;8] tally [6;8] tally [2;6;8] tally [2;6;8] tally [4;2;6;8] tally [4;2;6;8] Ozye˘gin¨ University — CS 321 Programming Languages 3 Ozye˘gin¨ University — CS 321 Programming Languages 3 Functions calls
    [Show full text]