DOCSLIB.ORG

An Experimental Applicative Programming Language for Linguistics and String Processing P.A.C

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
An Experimental Applicative Programming Language for Linguistics and String Processing P.A.C AN EXPERIMENTAL APPLICATIVE PROGRAMMING LANGUAGE FOR LINGUISTICS AND STRING PROCESSING P.A.C. Bailes and L.H. Reeker DeparTment of Computer Science, University of Queensland, St. Lucia, Queensland, Auslralia 4067 Summar~ been retained, and in fact, improved. In an applicative framework, the pattern match The Post-X language is designed to must return a value that can be acted upon provide facilities for pattern-directed by other functions. The pattern itself has processing of strings, sequences and trees in been generalized to a much more powerful an integrated applicative format. data object, called the FORM. Post-X is an experimental language A FORM consists of a series of designed for string processing, and for the alternative PATTERNS and related ACTIONS. other types of operations that one often Each pattern is very much like a pattern in undertakes in computational linguistics and SNOBOL4 (with some slight variations). FORMS language data processing. may be passed parameters (by value), which are then used in the pattern or action portion. In the design of Post-X, the following four goals have been foremost: A PATTERN determines the structure of the string to which it is matched. The pattern (I) To modernize the Markov algorithm based contains a sequence of concatenated elements, pattern matching paradigm, as embodied in which are themselves PATTERNS, PRIMITIVE such languages as COMIT 13 and SNOBOL 8 ; PATTERNS (utilizing most of the SNOBOL4 primitives) or STRINGS. The value returned by (2) To provide a language useful in the pattern is either FALSE (if it fails to computational linguistics and language data match) or a "parse tree" designating the processing, in particular, but hopefully with structure of the string that corresponds to wider applicability; portions of the pattern. As an example, suppose that a pattern is P:=p1^P2^...^pn" (3) To provide a vehicle for the study of It may be matched to a string S=SoSl...s n by applicative programming, as advocated by the use of the operator '~in", and if each of Backus , among others; the Pi match a successive letter s j, one can conceptualize the "tree" returned as (4) To provide a vehicle to study the applic- ation of natural language devices in programming languages, as advocated by Hsu 9 and Reekerl~ s O s I • .. s n Sn+ I The "X" in "Post-X" stands for where s O represents the unmatched portion to "experimental", and is a warning that features the left of the matched portion and Sn+. the of the language and its implementation may portion to the right of the matched portion. change from one day to the next. The eventual goal is to produce a language designed for The numbers I ..... n and the characters wide use, to be called "Post" (after the < and > in the example are SELECTORS, used logician Emil Post). In this paper, we shall in the ACTION portion to refer to the present some of the language's facilities for appropriate substring. The tree returned is string and tree processing. A more detailed denoted by $$, and ! is used for selection, statement of th~ rationale behind the language but $$! can be condensed to $ in this can be found in , and more~details of the context, so the expression $ < returns s O in language are to be found in- . the example above, while $ 2 returns s 2. The selectors give the effect of the short Pattern Matching persistence variables that were found in COMIT, where they were denoted by numerals. These The basic idea of using pattern matching variables had the advantage of having their to direct a computation is found in the normal scope limited to a single line of the program, algorithms of Markov, and was embodied in the thus minimizing the number of variables early string processing language COMIT. The defined at any one time. In Post-X, the series of SNOBOL languages developed at Bell selectors are local to a particular FORM. Laboratories, culminating in SNOBOL4, improved a number of awkward features of Each of the s may be a subtree, rather COMIT and added some features of their own. than a string. In the example above, if Pl Among these latter was the idea of patterns were defined as P11be12the^P ^ .^Pin,subtree then in as data objects. place of s I would Post-X incorporates patterns into an applicative framework, which will be illus- tFated below. In doing so, the powerful pattern matching features of SNOBOL4 have Sll s12 Sln --520-- where is the portion matched by P11 etc. free parsing creates no difficulties. Then s11Sllwould be referenced by $ I . I. Thus we may define Composition of functions is often necess- ary. For the composition of F and G, we write E:=E^"+"^T I T F:G. For example T:=T^"*"^F I F head:sort F:=,,(,,^E^,,),, I ,,x,, where "head" gives the first element of a Then the pattern match sequence and "sort" sorts a sequence of strings into alphabetical order, defines a function E = "x+x*x" which operates on a sequence of strings and gives the first in alphabetical order. will return the tree Certain natural variations in the syntax (E) are permitted. For example (E) +~T expression Iop expression 2 (E) + (T) is defined to be the same as (T) (T) * (~) (op):[expression I, expression2]. (F) (F) x The existence of a conditional function X X cond [a,b,c] The default action is to produce an unlabelled on producing "b v' or "c" depending "a" is tree "compressed" by the elimination of single vital; Post-X allows for a multi-way branch of offspring nodes. The example above is given by the form the tree (pictorially). if condition I then expression I elif condition 2 then expression 2 elif X else expression fi n X ~ X the form or the sequence do sequence of names expression [ ["x","+",E"x","x","x"7 ],"+","x"] od If a labelled phrase marker is desired, then is an expression whose value is the function appropriate actions need to be attached. For which may be applied to a sequence of instance, if a parenthesized representation epxressions, the value of each of which is of the tree above with node labels added is given in the expression (in the d_o_o ... o d) desired, the forms would be" by the corresponding name (i.e. call-by-value). The value of the application is the value of E :=E^,,+,,^T {,,E[,,^$i^,,, +, ,,^$3^,, ],,} the expression (with "substituted" parameters). 1 T {"E["^$ I^"]"}; User-defined functions are named by declarations, T: =T^,,.,,^F {,,T[,,^$i^,,, *, ,,^$3^,, ],,} examples of which are given later, and defined I F {"T["^$1 ^"]"}; In • F:=,, (,, ^E^, ),, {,,F[(,,^$2^,,) ],,} We have already discussed the bas,ic I "x" {"FEM]"}; pattern matching operation and the definition of the FORMS used in that operation. As may In the example above, the application of E be apparent from that discussion, context would return "E[E[E[T[ F[x] ] ],+,T[T[ F[x] ], *, FEx] ]],+,T[x] ]" --521-- Translation to a prefix representation of E:=E^"+"^T {$I + $3} the arithmetic expression could, incidentally, IT; be accomplished by a slight change in the T:=T^"*"^F {$I * $3} actions: rF; F:='('^E^') f {$2} E:=E^"+"^T {"+"^$I ^$3} r span (0..9) {$I}; r T; T:=T^"*"^F {"*"^$I ^$3} Certain predefined patterns and pattern-returning I F; functions are available, being closely modelled F:=" (" ^E^") '' {$2} on those of SNOBOL4 e.g. 3 "x"; any string This time, E="x+x*x" would yield arb break string ++X*XXX. span string arbno string Context sensitive - and even more complex etc... - parsing can be effected by building programs into the actions to give the effect of augmented transition networks. Two Examples It should also be noted that the actions need not merely pass back a single value. I. Random Generation of Sentences Several values may be associated with a node, as in attribute grammars I0. For example Given a context-free grammar as a sequence of rules in BNF notation (i.e. left E'.--E^"+''^T{ and right hand sides separated by "::=", value := $1.value + $3.value; nonterminals surrounded by angle brackets), code := $1.code^$3.code ^" add" we wish to randomly generate sentences from the grammar. We shall assume for simplicity } that a pseudo-random number generator RANDOM I T; is available which generates a number in an appropriate range each time that it is called. T: =T ^''*''^Fa We assume also that the grammar is a string value := $1.value + $3.value; of productions, separated by ";" and is called code := $1.code^$3.code ^" times" GRAM. } I F; The program will utilize a form LHS_FIND to find a production with a particular left F:=,,("^E ,,),, hand side and return its right hand side. {value := $2.value; code := $2.code LHS FIND LHS := LHS^"::="^BREAK";"^";"{$3}; } I span ("0'~.."9'') The alternatives on the right hand side are then converted to a sequence by the {value := $I; pattern ALT_LIST: code := " "^$I}; ALT_LIST := BREAK "I ''^'ir'' {[$1]^(ALT_ LIST <$)>} (As In SNOBOL4, a numerical string in a I REM {[$I]}; numerical context is treated as a number.) The particular alternative on the right Reference to the attributes of a node hand side is chosen by the procedure may be made in several ways. For example, in the last grammar given, (E = "1+2*3").value SELECT RHS LIST := LIST ! ((RANDOM MOD would have the value 7, as would value SIZE(LIST))+I); (E="I+2"3") or (E="1+2*3")~"value"; and (E+"1+2*3").code would be evaluated as The replacement in the evolving sentential "I 2 3 times add".
Load more

Recommended publications
  • CSC 272 - Software II: Principles of Programming Languages
    CSC 272 - Software II: Principles of Programming Languages Lecture 1 - An Introduction What is a Programming Language? • A programming language is a notational system for describing computation in machine-readable and human-readable form. • Most of these forms are high-level languages , which is the subject of the course. • Assembly languages and other languages that are designed to more closely resemble the computer’s instruction set than anything that is human- readable are low-level languages . Why Study Programming Languages? • In 1969, Sammet listed 120 programming languages in common use – now there are many more! • Most programmers never use more than a few. – Some limit their career’s to just one or two. • The gain is in learning about their underlying design concepts and how this affects their implementation. The Six Primary Reasons • Increased ability to express ideas • Improved background for choosing appropriate languages • Increased ability to learn new languages • Better understanding of significance of implementation • Better use of languages that are already known • Overall advancement of computing Reason #1 - Increased ability to express ideas • The depth at which people can think is heavily influenced by the expressive power of their language. • It is difficult for people to conceptualize structures that they cannot describe, verbally or in writing. Expressing Ideas as Algorithms • This includes a programmer’s to develop effective algorithms • Many languages provide features that can waste computer time or lead programmers to logic errors if used improperly – E. g., recursion in Pascal, C, etc. – E. g., GoTos in FORTRAN, etc. Reason #2 - Improved background for choosing appropriate languages • Many professional programmers have a limited formal education in computer science, limited to a small number of programming languages.
    [Show full text]
  • Note Quiz 1 K All 10 Questions Ise File Main Sy Thay Note Handouts Main Note Keyword Ko Search Krien Important Points Hain Jin Ko Lazmi Yaad Krna Hy
    Note Quiz 1 k all 10 questions ise file main sy thay Note handouts main note keyword ko search krien important points hain jin ko lazmi yaad krna hy. Ada discriminate types is similar to . C/C++ pointer C/C++ union C/C++ reference All of the given Page # 52 - My Ok The block structure feature of ALGOL60 has scope. No Local Universal Global Page # 26 – My Ok Unlike C/C++, Ada can have _____ within functions/procedures. Objects Functions/procedures Events Parameters Page # 58 – My Ok In the Decimal fixed point type, the distance between values is implemented as a power of 2 10 8 16 Page # 50 – My Ok Function must have at least ______ return statement. Three Two One Four Page # 57 – My Ok Every function must have at least one return statement. A procedure is not required to have any return statements. The expression in a function's return statement must evaluate to a type that matches the return type in the function's declaration. ______ operations must have one of its parameters of the tagged type. Concurrent Synchronized Primitive Generic Page # 59 – My Ok An understanding of implementation issues leads to a/an ______ of why languages are designed the way they are. Uncertainty Understanding Misunderstanding Confusion Page # 5 – My Ok ________ has an efficient use of processor and memory. Plankul Kool LISP CORBA C++ Imperative programming languages are the direct result of . Charles Babbage engine Logic or list program languages. Von Neumann architecture Language application domain Page # 22 – My Ok Following are imperative languages EXCEPT LISP C FORTRAN PASCAL Page # 22 – My Ok Which statement is true from programming language evolution perspective about 1970's era? Analysis and elaboration era Era of effective software technology Era of object oriented programming languages Era of discovery and description Page # 30 – My Ok SNOBOL language questions starts from here Variable name in SNOBOL may not be longer than .
    [Show full text]
  • ED027743.Pdf
    DOCUMENT RESUME ED 027 743 EM 007 134 By-Fasana, Paul J., Ed.; Shank, Russell, Ed. Tutorial on Generalized Programming Language s and Systems. Instructor Edition. American Society for Information Science, Washington, D.C. Spons Agency-National Science Foundation, Washington, D.C. Pub Date Jul 68 Grant- F -NSF -GN -657 Note-65p.; Manual based on materials prepared and presented by Thomas K. Burgess and others at the Annual Convention of the American Society for Information Science (New York, October 22-26, 1967) EDRS Price MF-$0.50 HC-$3.35 Descriptors-*Computer Science, *Computer Science Education, Information Retrieval, Information Storage, *Manuals Identifiers-COBOL, FORTRAN, PL I, SNOBOL This instructor's manual is a comparative analysis and review of the various computer programing languagescurrentlyavailable andtheircapabilitiesfor performing text manipulation, information storage, and data retrieval tasks. Based on materials presented at the 1967 Convention of the American Society for Information Science,themanualdescribes FORTRAN, a language designedprimarilyfor mathematicalcomputation;SNOBOL, alist-processinglanguagedesignedfor information retrieval application; COBOL, a business oriented language; and PL/L a new language incorporating many of the desirable features of FORTRAN andCOBOL but as yet implemented only for the IBM 360 computer system. (TI) U.S. DEPARTMENT OF HEALTH, EDUCATION & WELFARE OFFICE OF EDUCATION Pek THIS DOCUMENT HAS BEEN REPRODUCED EXACTLY AS RECEIVED FROM THE N. PERSON OR ORGANIZATION ORIGINATING IT.POINTS Of VIEW OR OPINIONS rJ STATED DO NOT NECESSARILY REPRESENT OFFICIAL OFFICE OF EDUCATION TUTORIAL ON POSITION OR POLICY. GENERALIZED PROGRAMMING LANGUAGES AND SYSTEMS Instructor Edition. Edited by Paul J. Fasana Columbia University Libraries New York, N. Y. and Russell Shank The Smithsonian Institution Washington, D.
    [Show full text]
  • The Evolution of Lua
    The Evolution of Lua Roberto Ierusalimschy Luiz Henrique de Figueiredo Waldemar Celes Department of Computer Science, IMPA–Instituto Nacional de Department of Computer Science, PUC-Rio, Rio de Janeiro, Brazil Matematica´ Pura e Aplicada, Brazil PUC-Rio, Rio de Janeiro, Brazil [email protected] [email protected] [email protected] Abstract ing languages offer associative arrays, in no other language We report on the birth and evolution of Lua and discuss how do associative arrays play such a central role. Lua tables it moved from a simple configuration language to a versatile, provide simple and efficient implementations for modules, widely used language that supports extensible semantics, prototype-based objects, class-based objects, records, arrays, anonymous functions, full lexical scoping, proper tail calls, sets, bags, lists, and many other data structures [28]. and coroutines. In this paper, we report on the birth and evolution of Lua. We discuss how Lua moved from a simple configuration Categories and Subject Descriptors K.2 [HISTORY OF language to a powerful (but still simple) language that sup- COMPUTING]: Software; D.3 [PROGRAMMING LAN- ports extensible semantics, anonymous functions, full lexical GUAGES] scoping, proper tail calls, and coroutines. In §2 we give an overview of the main concepts in Lua, which we use in the 1. Introduction other sections to discuss how Lua has evolved. In §3 we re- late the prehistory of Lua, that is, the setting that led to its Lua is a scripting language born in 1993 at PUC-Rio, the creation. In §4 we relate how Lua was born, what its original Pontifical Catholic University of Rio de Janeiro in Brazil.
    [Show full text]
  • SNOBOL-Tone (ST) - a Sound Pattern-Matching Programming Language
    SNOBOL-Tone (ST) - A Sound Pattern-Matching Programming Language Dan Ophir(1) and Dotan Dekel(2) AFEKA, Tel-Aviv Academic College of Engineering, Tel Aviv, Israel (1) [email protected] (2) [email protected] Abstract Keywords: Interpreter, Fast Fourier Transform, Pattern- The proposed programming language, matching, MLAT – Multi Level Adaptive SNOBOL-Tone, performs sound matching in a Technique. given sound stream. This is analogous to pattern-matching of substrings in a given 1. Introduction string, as is done in the SNOBOL language [1]. SNOBOL-Tone is a Domain Specific One way to perform the SNOBOL-Tone pattern Language (DSL) for the specific purpose of matching of a spoken text is to transcribe the treating tones, sounds and signals [5]. Another text into written text followed by regular language that has a similar function is CSound SNOBOL pattern matching [2]. However, [6]. Csound is a computer programming when the sound stream is not a spoken stream language for sound, also known as a sound another solution is needed. SNOBOL-Tone is compiler or an audio programming language, designed to provide such a solution. or more precisely, an audio DSL. It is called SNOBOL-Tone integrates three scientific Csound because it is written in C, as opposed domains: to some of its predecessors. 1. Computer science – creating 2. SNOBOL Concepts compilers and interpreters; 2. Electronic engineering – building SNOBOL [1] is a string pattern matching filters of various frequencies; programming language based on a single 3. Applied mathematics – Fourier statement: transformations, wavelets, optimization of algebraic expressions (1) <label>: <subject> <pattern> = and multi-level-adaptive-techniques <object> :S(label1)F(label2) to accelerate various filtering algorithms [3].
    [Show full text]
  • CALICO Journal, Volume 3 Number 2 41 PILOT, SNOBOL, and LOGO AS
    PILOT, SNOBOL, AND LOGO AS COMPUTING TOOLS FOR FOREIGN-LANGUAGE INSTRUCTION Ruth H. Sanders ABSTRACT Three programming languages widely available for microcomputers deserve attention from the foreign- language academic community because of their ease of use and their particular facility in manipulating language. PILOT, SNOBOL, and Logo are described and evaluated as tools for foreign-language CAI, and a small sample program in each language is given. A bibliography is included. KEYWORDS: PILOT, SNOBOL, Logo, description, evaluation, pattern-matching, programming languages, courseware development. Most programming languages would fail any reasonable test for user friendliness. BASIC, up to now the standard microcomputing language for computer non-professionals, can be daunting to those untrained in algorithmic thinking and manipulation of formal symbols. Higher-level languages like Pascal, C or Ada seem even less suited to computing novices. There are, however, programming languages that are relatively easy for beginners to learn and to use with some proficiency. Three of these, PILOT, SNOBOL, and Logo, are especially well suited to language manipulation. The foreign language professional who wants to write computer tutorials but does not want to invest a great deal of time learning to program should investigate these. In fact, even those who program in other languages may find that these three offer some advantages for certain kinds of programming tasks. This article describes these three languages but does not review any particular implementation of any of them. All are available for a wide range of microcomputers, at varying costs; implementations on various machines or operating systems are not identical, and some implementations offer advantages over others.
    [Show full text]
  • Advanced Programming Language Design (Raphael A. Finkel)
    See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/220692467 Advanced programming language design. Book · January 1996 Source: DBLP CITATIONS READS 41 3,040 1 author: Raphael Finkel University of Kentucky 122 PUBLICATIONS 6,757 CITATIONS SEE PROFILE All content following this page was uploaded by Raphael Finkel on 16 December 2013. The user has requested enhancement of the downloaded file. ADVANCED PROGRAMMING LANGUAGE DESIGN Raphael A. Finkel ❖ UNIVERSITY OF KENTUCKY ▲ ▼▼ Addison-Wesley Publishing Company Menlo Park, California · Reading, Massachusetts New York · Don Mills, Ontario · Harlow, U.K. · Amsterdam Bonn · Paris · Milan · Madrid · Sydney · Singapore · Tokyo Seoul · Taipei · Mexico City · San Juan, Puerto Rico hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh On-line edition copyright 1996 by Addison-Wesley Publishing Company. Permission is granted to print or photo- copy this document for a fee of $0.02 per page, per copy, payable to Addison-Wesley Publishing Company. All other rights reserved. Acquisitions Editor: J. Carter Shanklin Proofreader: Holly McLean-Aldis Editorial Assistant: Christine Kulke Text Designer: Peter Vacek, Eigentype Senior Production Editor: Teri Holden Film Preparation: Lazer Touch, Inc. Copy Editor: Nick Murray Cover Designer: Yvo Riezebos Manufacturing Coordinator: Janet Weaver Printer: The Maple-Vail Book Manufacturing Group Composition and Film Coordinator: Vivian McDougal Copyright 1996 by Addison-Wesley Publishing Company All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or any other media embodiments now known, or hereafter to become known, without the prior written permission of the publisher.
    [Show full text]
  • Generations of Computers
    Chapter- 2 Generations of Computers The rapid development was characterized by the phases of growth, which have come to be called generation of computer. First Generation Basic component – Vacuum Tubes 1940-1956 Vacuum Tube consumed huge amount of electricity. Processing Speed – Slow & Unreliable Machine Heat Generation – Huge amount of Heat generated Size – Bulky & Non – Portable Machine. Lying frequently hardware failure. Instructions – Only Machine Language was used User Friendly – Very Difficult to operate Cost – Production & Maintenance costs was very High Example – ENIAC , UNIVAC , EDVAC, EDSAC, IBM-701 ENIAC - Electronic Numerical Integrator and Calculator UNIVAC - Universal Automatic Computer (First Digital Computer) EDVAC – Electronic discrete variable automatic computer EDSAC – Electronic delay storage automatic calculator IBM – International Business Machine Second Generation Basic component – Transistors & Diodes Processing Speed – More reliable than 1st one Heat Generation – Less amount of Heat generated Size – Reduced size but still Bulky Instructions – High level Language was used ( Like COBOL , ALGOL, SNOBOL) COBOL – Common Business Oriented Language ALGOL – ALGOrithmic Language SNOBOL – StriNg Oriented Symbolic Language User Friendly – Easy to operate from 1st one Cost – Production & Maintenance costs was < 1st Example – IBM 7090, NCR 304 Third Generation Basic component – IC (Integrated Circuits ) 1964-1971 IC is called micro electronics technology integrate a large number of circuit components in to
    [Show full text]
  • SNOBOL4 in MTS
    M T S The Michigan Terminal System Volume 9: SNOBOL4 in MTS September 1975 Updated June 1979 (Update 1) Updated May 1984 (Update 2) The University of Michigan Computing Center Ann Arbor, Michigan 1 DISCLAIMER This manual is intended to represent the current state of the Michigan Terminal System (MTS), but because the system is constantly being developed, extended, and refined, sections of this manual will become obsolete. The user should refer to the Computing_________ Center______ Newsletter,__________ Computing Center Memos, and future updates to this manual for the latest information about changes to MTS. Copyright 1979 by the Regents of the University of Michigan. Copying is permitted for nonprofit, educational use provided that (1) each reproduction is done without alteration and (2) the volume reference and date of publication are included. Permission to republish any portions of this manual should be obtained in writing from the Director of the University of Michigan Computing Center. 2 MTS 9: SNOBOL4 in MTS September 1975 Page Revised May 1984 PREFACE_______ The software developed by the Computing Center staff for the operation of the high-speed IBM 370-compatible computers can be described as a multipro- gramming supervisor that handles a number of resident, reentrant programs. Among them is a large subsystem, called MTS (Michigan Terminal System), for command interpretation, execution control, file management, and accounting maintenance. Most users interact with the computer’s resources through MTS. The MTS Manual is a series of volumes that describe in detail the facilities provided by the Michigan Terminal System. Administrative poli- cies of the Computing Center and the physical facilities provided are described in a separate publication entitled Introduction_________________________ to Computing Center_______________ Services.
    [Show full text]
  • Evolution of the Major Programming Languages Genealogy of Common Languages Zuse’S Plankalkül
    CHAPTER 2 Evolution of the Major Programming Languages Genealogy of Common Languages Zuse’s Plankalkül • Designed in 1945, but not published until 1972 • Never implemented • Advanced data structures • floating point, arrays, records • Invariants Plankalkül Syntax • An assignment statement to assign the expression A[4] + 1 to A[5] | A + 1 => A V | 4 5 (subscripts) S | 1.n 1.n (data types) Minimal Hardware Programming: Pseudocodes • What was wrong with using machine code? • Poor readability • Poor modifiability • Expression coding was tedious • Machine deficiencies--no indexing or floating point Pseudocodes: Short Code • Short Code developed by Mauchly in 1949 for BINAC computers • Expressions were coded, left to right • Example of operations: 01 – 06 abs value 1n (n+2)nd power 02 ) 07 + 2n (n+2)nd root 03 = 08 pause 4n if <= n 04 / 09 ( 58 print and tab Pseudocodes: Speedcoding • Speedcoding developed by Backus in 1954 for IBM 701 • Pseudo ops for arithmetic and math functions • Conditional and unconditional branching • Auto-increment registers for array access • Slow! • Only 700 words left for user program Pseudocodes: Related Systems • The UNIVAC Compiling System • Developed by a team led by Grace Hopper • Pseudocode expanded into machine code • David J. Wheeler (Cambridge University) • developed a method of using blocks of re-locatable addresses to solve the problem of absolute addressing IBM 704 and Fortran • Fortran 0: 1954 - not implemented • Fortran I:1957 • Designed for the new IBM 704, which had index registers and floating point
    [Show full text]
  • The Implementation of Lua 5.0
    The Implementation of Lua 5.0 Roberto Ierusalimschy1, Luiz Henrique de Figueiredo2, Waldemar Celes1 1Department of Computer Science, PUC-Rio, Rio de Janeiro, Brazil. 2IMPA–Instituto de Matematica´ Pura e Aplicada, Rio de Janeiro, Brazil. Abstract. We discuss the main novelties of the implementation of Lua 5.0: its register-based virtual machine, the new algorithm for optimizing tables used as arrays, the implementation of closures, and the addition of coroutines. 1. Introduction Lua was born in an academic laboratory as a tool for in-house software development but somehow was adopted by several industrial projects around the world and is now widely used in the game industry.1 How do we account for this widespread use of Lua? We believe that the answer lies in our design and implementation goals: to provide an embeddable scripting language that is simple, efficient, portable, and lightweight. These have been our main goals since the birth of Lua in 1993 and they have been respected during its evolution. (For a history of the development of Lua up to just before the release of Lua 5.0, see [12].) These features, plus the fact that Lua has been designed from the start to be embedded into larger applications, account for its early adoption by the industry.2 Widespread use generates demand for language features. Several features of Lua have been motivated by industrial needs and user feedback. Important examples are the introduction of coroutines in Lua 5.0 and the implementation of incremental garbage col- lection in the upcoming Lua 5.1. Both features are specially important for games.
    [Show full text]
  • Modern Programming Languages
    Modern Programming Languages Lecture 9-12 An Introduction to SNOBOL Programming Language SNOBOL stands for StriNg Oriented SymBOlic Language. It is a Special purpose language for string manipulation and handling. It was developed in 1962 at the Bell Labs by Farber, Griswold, and Polensky. It was created out of the frustrations of working with the languages of that time because they required the developers to write large programs to do a single operation. It was used to do most of the work in designing new software and interpreting different language grammars. Toward the end of the eighties, newer languages were created which could also be used for string manipulation. They include the PERL and AWK. Unlike SNOBOL, Perl and Awk use regular expressions to perform the string operations. Today, roughly forty years after its release, the language is rarely used! SIMPLE DATA TYPES Initial versions of SNOBOL only supported Integers and Strings as the basic data types. Real numbers were originally not allowed but were added to the language later on. Integers Both positive and negative integers were supported. Following are some examples of integers in SNOBOL. 14 -234 0 0012 +12832 -9395 +0 It was illegal to use a decimal point or comma in a number. Similarly, numbers greater than 32767 (that is, 215 – 1) could not be used as well. For the negative numbers, the minus sign has to be used without any spaces between the sign and the number. Following are therefore some examples of illegal numbers: 13.4 49723 - 3,076 As mentioned earlier, real numbers were allowed in the later versions of the language and hence 13.4 is a legal number in SNOBOL4.
    [Show full text]