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

Total Page:16

File Type:pdf, Size:1020Kb

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 . 150 characters 250 characters 500 characters 120 characters Page # 33 – My Ok If we have two spaces in SNOBOL the first is used for and the second one for . concatenation, pattern matching immediate assignment, replacement pattern matching, concatenation as a whole assignment, immediate assignment. Page # 35 & 36 – My Ok In SONOBOL 2 spaces can be used, the purpose of 1st space is for _____ and 2nd for Pattern matching, String Concatenation String concatenation, Pattern matching Page # 35 & 36 – My Ok Which statement is correct about Table in SNOBOL? Table is indexed by number Table is indexed by the key Table can be indexed by both keys and numbers Table cannot be indexed Page# 43 – My Ok Which statement is correct about Table in SNOBOL? Table is indexed by number Table is indexed by the key value Table can be indexed by both keys and numbers Table cannot be indexed Page# 43 – My Ok The GOTO statement in SNOBOL is . Explicit pattern matched implicit an indirect reference. Click Here – My OK Which statement is true about SNOBOL? Its developers are computer experts Its developers have limited introduction with computer science Is an example of aspect programming languages Have many data types Page # 44 – My Ok SNOBOL is case_____. Sensitive In-Sensitive Super-Sensitive Not-Sensitive Page # 33 – My Ok SNOBOL is case ____ Sensitive InSensitive Super-Sensitive Not-Sensitive Page # 33 – My Ok SNOBOL was designed for______ purpose. String manipulation Al Business Scientific Page # 29 SNOBOL (1964) designed as a string manipulation language (at Bell Labs by Farber, Griswold, and Polensky). It had powerful operators for string pattern matching but suffered from poor readability and maintainability. Which of the following is used for indirect referencing in SNOBOL? Unary $ Binary S Unary & Binary & Page # 40 – My Ok Indirect referencing in SONOBOL is same as of _____in C. Arrays Pointers Aliasing Stack Page # 40 – My Ok SIZE () arid REPLACE () in SNOBOL4 are functions Primitive built-in user defined Both primitive and built-in Page # 41 – My Ok SIZE() and REPLACE() in SNOBOL4 are _________ functions Primitive built-in user defined both primitive and built-in Page # 41 – My Ok Control structure is a _________ statement If Else Switch Goto/Jump Statement For Loop Page # 44 – My Ok Which of the following is the only Control structure in SNOBOL? My Quiz 1 Go to Statement If Else statement Switch statement Both if else and switch statement Page # 44 – My Ok The space operator in SNOBOL has _____ precedence than arithmetic operators. Lower Higher Higher and Lower None of the given Page # 35 – My Ok The space operator has _____ precedence than arithmetic operators. Higher Lower Higher and Lower None of the given Page # 35 – My Ok SNOBOL stands for StriNg Oriented SymBOlic Language Binary operator in SNOBOL must has at least _____ spaces on both sides 1 2 3 4 Page # 34 – My Ok In SONOBAL binary operators have at least____ spaces 1 2 3 4 Note as Binary operator in SNOBOL must has at least one space on both sides so it would have at least 2 spaces in total Binary operator Binary operator in SONOBOL must has at least spaces on both sides. 1 2 3 5 Page # 34 – My Ok Maps in SNOBOL are also available in ____ C C++ MATLAB Prolog Check as not confirmed Ask from the instructor SNOBOL language questions ends here Today about 50 % coding is done in . BASIC C ADA Visual Basic Check as Not sure – Ask from the instructor The first-level elements in LISP are called _ level elements. First Index Top Priority Page # 64 – My Ok The first-level elements in LISP are called top-level elements. For example top elements of list (a b c) are a, b, and c. Similarly, top elements of list (a (b c)) are a and (b c).An empty list is represented by nil. It is the same as (). To write a user defined function in LISP we use _ . Setq Defun Def func Func Page # 69 – My Ok In LISP, defun is used to write a user-defined function. Note that different dialects of LISP may use different keywords for defining a function. The syntax of defun is as below:(defun func- name (arg-1 ... Arg-n) func-body) Function in LISP is in notation. Postfix Infix Prefix None of the given Page # 64 – My Ok Function in LISP is in notation. Postfix Infix Prefix None of the given Page # 64 – My Ok In LISP, a function and a function call is also a list. It uses prefix notation as shown below: (function-name arg1 ... argn) Dotime loop of LISP is similar in working to of Ada. while loop for loop switch statement Both while loop and switch statement Page # 72 – My Ok Dotimes loop of LIPS similar working to _______ ada For Switch loop Do while While Page # 72 – My Ok may also change global variable as a side effect. time LISP iteration list LISP iteration dolist LISP iteration dotime LISP iteration Lecture # 20 – Time 42 minute. – My Ok The first argument in LISP list is the List Function Argument Atom Page # 65 – My Ok The first argument in LISP list is the List Function Argument Symbol Page # 65 – My Ok The second argument in LISP list is the List S-Expression Argument Symbol Page # 65 – My Ok The 2nd argument in LISP list is the List S-Expression Argument Symbol Page # 65 – My Ok We have extensive use of ___ in LISP. For loop Switch statement Recursion AI Page # 63 – My Ok For Recursion it is necessary that a language Dynamic Static Both dynamic and static Stack Java has no . multiple inheritance struct enum type All of the Given Page # 29 – My Ok Which of the following is a language designed for distributed computing architecture? CORBA FORTRAN ADA LISP Click Here – My Ok __________ does not have a predefined inheritance hierarchy. ALGOL PROLOG C++ Ada Page # 48 – My Ok Record in Ada is similar to structure in C/C++. Record members in Ada is accessed through a/an____ (.)Dot operator operator None of the given Click Here – My Ok We may create our own exceptions in _ . C SNOBOL C++ Ada Click Here – My Ok But we can also create exception in C and Java too but there we have to create an exception class A language is reliable if during execution it does not create . Result Error Bytecode Malfunction My Ok If the program written in a particular language is less than the cost of failure of the system may be significant. Writable Reliable General Readable Page # 20 – My Ok Conditional control transfer" gave rise to the idea of which are blocks of code that can be reused over and over. Namespaces Header Files Objects Libraries Page # 21 – My Ok Identify the feature which was not available in FORTRAN-IV. support for structured programming logical IF statement support for explicit type declarations subprograms could also be passed as parameters Page # 25 – My Ok Identify the feature which was available in FORTRAN-IV. logical IF statement support for explicit type declarations subprograms could also be passed as parameters All of the given Page # 25 – My Ok The earliest form of a computer language was motion. Physical Logical Virtual Spiritual Page #21 – My Ok The first high level language is . FORTRAN Plankal kool Ada SNOBOL Page # 25 – My Ok Which of the given resulted in more complex software requiring support for software engineering in programming. Increasing Hardware cost only Increasing Software cost only Increasing Hardware cost and Decreasing Software Cost Increasing Software cost and Decreasing Hardware Cost Page # 30 – My Ok COBOL is mainly designed for .
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]
  • 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]
  • The Implementation of Lua 5.0
    The Implementation of Lua 5.0 Roberto Ierusalimschy (Department of Computer Science, PUC-Rio, Rio de Janeiro, Brazil [email protected]) Luiz Henrique de Figueiredo (IMPA{Instituto de Matem´atica Pura e Aplicada, Rio de Janeiro, Brazil [email protected]) Waldemar Celes (Department of Computer Science, PUC-Rio, Rio de Janeiro, Brazil [email protected]) 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. Key Words: compilers, virtual machines, hash tables, closures, coroutines Category: D.3.4, D.3.3, D.3.2, E.2 1 Introduction Lua was born in an academic laboratory as a tool for in-house software develop- ment 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.
    [Show full text]