DOCSLIB.ORG

Pirate a Compiler for Lua Targeting the Parrot Virtual Machine

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Pirate a Compiler for Lua Targeting the Parrot Virtual Machine Pirate A Compiler for Lua targeting the Parrot Virtual Machine Klaas-Jan Stol June 6, 2003 Abstract The Lua programming language is a dynamically typed language with a simple syntax. It was designed to be extensible and embedded. Lua can be extended by the programmer so that events that otherwise would result in an error, can then be caught by user-de¯ned functions. Beside extending Lua, it is also possible to embed a Lua program within a host program. This way, the host program can invoke a Lua script for higher level tasks that are more easily programmed in Lua than in a lower level language such as C, although a Lua script may also be executed as a stand-alone program. The original distribution of Lua o®ers the programmer a Lua interpreter, or virtual machine. The interpreter can be used to execute a Lua script directly. Before actually executing the script, it is compiled into Lua byte-code. The interpreter can also be used to compile a script only, without actually running it. One way or the other, the Lua language and virtual machine are integrated. To be able to run a Lua script on another virtual machine, the Lua language must be separated from its original run-time environment. Parrot is a virtual machine that is currently being designed and implemented to execute dynamically typed languages. Because Parrot is able to execute dy- namically typed languages, then it should also be able to host the Lua language. This paper describes the design and implementation of Pirate, a Lua com- piler that targets the Parrot Virtual Machine. Not only is this an explo- ration of compiler construction theory and practice, it also demonstrates the re-implementation of a programming language to a new virtual machine. Pirate was not designed to execute a Lua script as an embedded program, but rather as a stand-alone application consisting of one or more modules (although it is possible to embed a Lua script compiled with Pirate). Because of the fact that Parrot will be able not only to run Perl 6 but other languages as well, it is interesting to investigate how these modules written in di®erent languages can cooperate. This o®ers a new use of the Lua language. Although Parrot is still under construction at this moment, many things are already operational and it was possible to implement a working Lua compiler. However, because certain features of the Lua language need rather speci¯c sup- port of Parrot that are not implemented yet, not all features of Lua have been implemented. Other features have a temporary implementation that will be changed at a later stage when the needed features of Parrot are fully opera- tional. Contents Preface 5 I Overview 7 1 Introduction 8 1.1 Compilers . 8 1.2 The Lua language . 9 1.3 Virtual Machines . 11 1.4 The Parrot Virtual Machine . 12 1.5 Running Lua on Parrot . 14 2 Overview of Compiler Organization 15 2.1 Introduction . 15 2.2 Compiler Organization . 15 2.3 Compiler Data-flow . 19 II Compiler Front-end 23 3 Syntactical Analysis 24 3.1 The Lexer . 24 3.2 The Parser . 26 3.3 The Abstract Syntax Tree . 31 3.4 Reporting Syntax Errors . 32 4 Scope Analysis 34 4.1 Lua Scope rules . 34 4.2 The Symbol Table . 36 4.3 Reporting Scope Errors . 39 III Compiler Back-end 40 5 Parrot Run-Time Environment 41 2 CONTENTS 3 5.1 Introduction . 41 5.2 Implementation of Lua Data Types . 41 5.3 Run-Time Storage Organization . 44 5.4 Parameter-Passing Modes . 45 5.5 Tag methods . 45 6 Generating Code 47 6.1 The Target Language . 47 6.2 Translating Control Structures . 48 6.3 Translating Assignments . 52 6.4 Translating Functions . 53 6.5 Translating Local Declarations . 58 6.6 Translating Data Structure References . 59 6.7 Implementing tags . 59 7 Optimizing Code 60 7.1 Optimizations in the IMC Compiler . 60 7.2 Optimizations in Pirate . 61 7.3 Implementation of the Code Optimizer . 62 IV Using Lua 63 8 Lua Libraries 64 8.1 The Standard Libraries . 64 8.2 Functions to Execute Lua Code . 65 9 The Lua Compiler for Parrot 67 9.1 Compiling Code . 67 9.2 Running Lua code . 68 9.3 Running other languages . 69 10 Conclusion 72 10.1 Design . 72 10.2 Implementation . 73 10.3 Where to go from here . 74 A Lexical and Syntactical Structure of Lua 77 A.1 Lexical Conventions for Lua . 77 A.2 Syntactical Structure of Lua . 79 B Details for a Recursive Descent Parser 81 C Parrot Calling Conventions 83 C.1 Calling Conventions . 83 C.2 Returning Conventions . 84 CONTENTS 4 D Internal Data Structures 85 D.1 The Compiler State Structure . 85 D.2 The Symbol Table . 86 D.3 The Symbol Table Iterator . 88 D.4 The Stack . 90 E Instruction Sets 92 E.1 IMC Instructions . 92 E.2 Parrot Instructions . 93 Bibliography 94 Preface This paper presents the design and implementation of Pirate, a Lua compiler that targets the Parrot virtual machine. This work was done in the last semester of my undergraduate education at the Hanzehogeschool Groningen. Pirate was created to explore the possibilities of re-targeting an existing programming lan- guage to a new platform, and to obtain a better understanding of compilers in general. For this purpose, the Lua language was re-targeted to the Parrot vir- tual machine, which will be the new virtual machine for the Perl 6 programming language. Content of this paper This paper consists of four parts. Part one is an introduction to the Lua lan- guage, the Parrot virtual machine and compilers in general. Chapter 1 intro- duces the Lua language, virtual machines and the Parrot virtual machine in particular. Chapter 2 gives an overview of compiler construction in general. Part two describes the implementation of the front-end of the compiler. The front-end is the part of the compiler that does syntax and contextual checking (such as scope checking) of the source program. Implementation of the syntac- tical analyzer is described in Chapter 3. Implementation of the scope checker is discussed in Chapter 4. Part three deals with the back-end of the compiler. The back-end of a compiler does not have to do any more checks on the source program. At this point of compilation, all errors should have been discovered. Chapter 5 ¯rst discusses some issues that must be dealt with before actual generating code. After that, Chapter 6 describes how machine instructions are generated. Chapter 7 describes the optimizer that tries to optimize the generated code. Part four ¯nally describes how Pirate can be used. Chapter 8 describes what Lua libraries are available in Pirate and which restrictions are present for using the libraries. After that, Chapter 9 explains in what ways Pirate can be used. Finally, the conclusion recapitulates the presented work and provides a list of known issues in the current implementation. After that, a list of potential future improvements is provided, that can be implemented at a later stage. CONTENTS 6 Obtaining Pirate Pirate is written in ansi C, so it should be possible to run the program on any platform that has a corresponding compiler. The software is available at: http://sourceforge.net/projects/luaparrot/ Readership This report is aimed at people that have some experience in programming in a higher level programming language, such as Java, C or Pascal. I assume the reader understands what a compiler does, and has a basic knowledge of scripting languages. No knowledge of compilers or compiler theory is assumed. Acknowledgments At this point I would like to express my gratitude towards Martijn de Vries for his supervision and helpful tips. I would also like to thank the people of the Perl 6 community for their responsive reactions and contributions. Klaas-Jan Stol Part I Overview Chapter 1 Introduction 1.1 Compilers A compiler is the basic tool for any modern programmer. Any program written in a high-level programming language must be translated to some form that can be understood by a computer. For example, it is not possible for a computer to understand the following Lua program: do x = 1 + 2 end For the computer to be able to execute such a program, it must be translated to some form of machine code, like this: new P0, .LuaNumber # create a new number variable set P0, 1 # set this variable to the value 1 add P0, 2 # add 2 to this number store global "x", P0 # store the value with name "x" The instructions above are examples of the machine code for the Parrot Virtual Machine. Actually, the mnemonics for the instructions are printed here, for ease of reading. The actual machine code is in binary form. To be able to exe- cute the above instructions, these mnemonics should be translated to a binary format by the assembler. The translation of a programming language to machine instructions (or its mnemonics) is done by a compiler. A compiler does not necessarily translate a programming language. There are more types of compilers. For example, the program that formatted this report, LATEX, is in fact a compiler too. The text is typed in as plain text, and all kinds of commands are used to indicate which text is a chapter title, paragraph title, normal text, et cetera. Chapter 2 gives a more detailed overview of the tasks of a compiler. 1.2. THE LUA LANGUAGE 9 1.2 The Lua language This section gives an overview of the Lua language.
Load more

Recommended publications
  • Learning to Program in Perl
    Learning to Program in Perl by Graham J Ellis Languages of the Web Learning to Program in Perl version 1.7 Written by Graham Ellis [email protected] Design by Lisa Ellis Well House Consultants, Ltd. 404, The Spa, Melksham, Wiltshire SN12 6QL England +44 (0) 1225 708 225 (phone) +44 (0) 1225 707 126 (fax) Find us on the World Wide Web at: http://www.wellho.net Or contact us at: [email protected] Copyright © 2003 by Well House Consultants, Ltd. Printed in Great Britain. Printing History May 1999 1.0 First Edition February 2000 1.1 Minor additions June 2000 1.2 Compliation of modules October 2000 1.3 Name change, revisions April 2002 1.4 Added modules September 2002 1.5 Added modules January 2003 1.6 Updated modules February 2003 1.7 Updated modules This manual was printed on 21 May 2003. Notice of Rights All rights reserved. No part of this manual, including interior design, may be reproduced or translated into any language in any form, or transmitted in any form or by any means electronic, mechanical, photocopying, recording or otherwise, without prior written permission of Well House Consultants except in the case of brief quotations embodied in critical articles and reviews. For more information on getting permission for reprints and excerpts, contact Graham Ellis at Well House Consultants. This manual is subject to the condition that it shall not, by way of trade or otherwise, be lent, sold, hired out or otherwise circulated without the publisher's prior consent, incomplete nor in any form of binding or cover other than in which it is published and without a similar condition including this condition being imposed on the subsequent receiver.
    [Show full text]
  • Hacker Public Radio
    hpr0001 :: Introduction to HPR hpr0002 :: Customization the Lost Reason hpr0003 :: Lost Haycon Audio Aired on 2007-12-31 and hosted by StankDawg Aired on 2008-01-01 and hosted by deepgeek Aired on 2008-01-02 and hosted by Morgellon StankDawg and Enigma talk about what HPR is and how someone can contribute deepgeek talks about Customization being the lost reason in switching from Morgellon and others traipse around in the woods geocaching at midnight windows to linux Customization docdroppers article hpr0004 :: Firefox Profiles hpr0005 :: Database 101 Part 1 hpr0006 :: Part 15 Broadcasting Aired on 2008-01-03 and hosted by Peter Aired on 2008-01-06 and hosted by StankDawg as part of the Database 101 series. Aired on 2008-01-08 and hosted by dosman Peter explains how to move firefox profiles from machine to machine 1st part of the Database 101 series with Stankdawg dosman and zach from the packetsniffers talk about Part 15 Broadcasting Part 15 broadcasting resources SSTRAN AMT3000 part 15 transmitter hpr0007 :: Orwell Rolled over in his grave hpr0009 :: This old Hack 4 hpr0008 :: Asus EePC Aired on 2008-01-09 and hosted by deepgeek Aired on 2008-01-10 and hosted by fawkesfyre as part of the This Old Hack series. Aired on 2008-01-10 and hosted by Mubix deepgeek reviews a film Part 4 of the series this old hack Mubix and Redanthrax discuss the EEpc hpr0010 :: The Linux Boot Process Part 1 hpr0011 :: dd_rhelp hpr0012 :: Xen Aired on 2008-01-13 and hosted by Dann as part of the The Linux Boot Process series.
    [Show full text]
  • 2016 8Th International Conference on Cyber Conflict: Cyber Power
    2016 8th International Conference on Cyber Conflict: Cyber Power N.Pissanidis, H.Rõigas, M.Veenendaal (Eds.) 31 MAY - 03 JUNE 2016, TALLINN, ESTONIA 2016 8TH International ConFerence on CYBER ConFlict: CYBER POWER Copyright © 2016 by NATO CCD COE Publications. All rights reserved. IEEE Catalog Number: CFP1626N-PRT ISBN (print): 978-9949-9544-8-3 ISBN (pdf): 978-9949-9544-9-0 CopyriGHT AND Reprint Permissions No part of this publication may be reprinted, reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior written permission of the NATO Cooperative Cyber Defence Centre of Excellence ([email protected]). This restriction does not apply to making digital or hard copies of this publication for internal use within NATO, and for personal or educational use when for non-profit or non-commercial purposes, providing that copies bear this notice and a full citation on the first page as follows: [Article author(s)], [full article title] 2016 8th International Conference on Cyber Conflict: Cyber Power N.Pissanidis, H.Rõigas, M.Veenendaal (Eds.) 2016 © NATO CCD COE Publications PrinteD copies OF THIS PUBlication are availaBLE From: NATO CCD COE Publications Filtri tee 12, 10132 Tallinn, Estonia Phone: +372 717 6800 Fax: +372 717 6308 E-mail: [email protected] Web: www.ccdcoe.org Head of publishing: Jaanika Rannu Layout: Jaakko Matsalu LEGAL NOTICE: This publication contains opinions of the respective authors only. They do not necessarily reflect the policy or the opinion of NATO CCD COE, NATO, or any agency or any government.
    [Show full text]
  • A Java Virtual Machine Extended to Run Parrot Bytecode
    A JAVA VIRTUAL MACHINE EXTENDED TO RUN PARROT BYTECODE A thesis submitted to the University of Manchester for the degree of Master of Science in the Faculty of Engineering and Physical Sciences 2006 By Martin Dahl School of Computer Science Contents Abstract 8 Declaration 9 Copyright 10 Acknowledgements 11 1 Introduction 12 1.1 Objectives and Motivation . 13 1.2 Related Work . 13 1.2.1 Parrot . 14 1.2.2 Pugs . 14 1.2.3 PearColator . 14 1.3 Organisation of the Thesis . 15 2 The Parrot Project 16 2.1 Perl 6 . 17 2.1.1 Design . 17 2.1.2 Perl 6 Internals . 18 2.1.3 Pugs . 19 2.1.4 Parrot Perl 6 Compiler . 19 2.2 Virtual Machine . 20 2.2.1 Design . 20 2.2.2 Architecture . 21 2.2.3 Registers . 22 2.2.4 Instruction Set . 23 2.2.5 Parrot Assembly Language and Intermediate Representation 24 2 2.3 Parrot Magic Cookies . 24 2.3.1 Core PMCs . 24 2.3.2 Other PMCs . 27 2.4 Compiler suite . 27 2.4.1 Perl 6 . 27 2.4.2 Other languages . 27 2.5 Summary . 28 3 Parrot Bytecode Format 30 3.1 Header . 31 3.2 Bytecode Format 1 . 33 3.2.1 Directory Segment . 34 3.2.2 Constant Table Segment . 35 3.2.3 Bytecode Segment . 38 3.2.4 Debug Segment . 38 3.2.5 Fixup Segment . 39 3.3 Summary . 40 4 Parakeet 41 4.1 Overview . 42 4.2 Jikes RVM . 43 4.3 PearColator .
    [Show full text]
  • Threat Modeling and Circumvention of Internet Censorship by David Fifield
    Threat modeling and circumvention of Internet censorship By David Fifield A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor J.D. Tygar, Chair Professor Deirdre Mulligan Professor Vern Paxson Fall 2017 1 Abstract Threat modeling and circumvention of Internet censorship by David Fifield Doctor of Philosophy in Computer Science University of California, Berkeley Professor J.D. Tygar, Chair Research on Internet censorship is hampered by poor models of censor behavior. Censor models guide the development of circumvention systems, so it is important to get them right. A censor model should be understood not just as a set of capabilities|such as the ability to monitor network traffic—but as a set of priorities constrained by resource limitations. My research addresses the twin themes of modeling and circumvention. With a grounding in empirical research, I build up an abstract model of the circumvention problem and examine how to adapt it to concrete censorship challenges. I describe the results of experiments on censors that probe their strengths and weaknesses; specifically, on the subject of active probing to discover proxy servers, and on delays in their reaction to changes in circumvention. I present two circumvention designs: domain fronting, which derives its resistance to blocking from the censor's reluctance to block other useful services; and Snowflake, based on quickly changing peer-to-peer proxy servers. I hope to change the perception that the circumvention problem is a cat-and-mouse game that affords only incremental and temporary advancements.
    [Show full text]
  • LAMP and the REST Architecture Step by Step Analysis of Best Practice
    LAMP and the REST Architecture Step by step analysis of best practice Santiago Gala High Sierra Technology S.L.U. Minimalistic design using a Resource Oriented Architecture What is a Software Platform (Ray Ozzie ) ...a relevant and ubiquitous common service abstraction Creates value by leveraging participants (e- cosystem) Hardware developers (for OS level platforms) Software developers Content developers Purchasers Administrators Users Platform Evolution Early stage: not “good enough” solution differentiation, innovation, value flows Later: modular architecture, commoditiza- tion, cloning no premium, just speed to market and cost driven The platform effect - ossification, followed by cloning - is how Chris- tensen-style modularity comes to exist in the software industry. What begins as a value-laden proprietary platform becomes a replaceable component over time, and the most successful of these components finally define the units of exchange that power commodity networks. ( David Stutz ) Platform Evolution (II) Example: PostScript Adobe Apple LaserWriter Aldus Pagemaker Desktop Publishing Linotype imagesetters NeWS (Display PostScript) OS X standards (XSL-FO -> PDF, Scribus, OOo) Software Architecture ...an abstraction of the runtime elements of a software system during some phase of its oper- ation. A system may be composed of many lev- els of abstraction and many phases of opera- tion, each with its own software architecture. Roy Fielding (REST) What is Architecture? Way to partition a system in components
    [Show full text]
  • Graceful Language Extensions and Interfaces
    Graceful Language Extensions and Interfaces by Michael Homer A thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Doctor of Philosophy Victoria University of Wellington 2014 Abstract Grace is a programming language under development aimed at ed- ucation. Grace is object-oriented, imperative, and block-structured, and intended for use in first- and second-year object-oriented programming courses. We present a number of language features we have designed for Grace and implemented in our self-hosted compiler. We describe the design of a pattern-matching system with object-oriented structure and minimal extension to the language. We give a design for an object-based module system, which we use to build dialects, a means of extending and restricting the language available to the programmer, and of implementing domain-specific languages. We show a visual programming interface that melds visual editing (à la Scratch) with textual editing, and that uses our dialect system, and we give the results of a user experiment we performed to evaluate the usability of our interface. ii ii Acknowledgments The author wishes to acknowledge: • James Noble and David Pearce, his supervisors; • Andrew P. Black and Kim B. Bruce, the other designers of Grace; • Timothy Jones, a coauthor on a paper forming part of this thesis and contributor to Minigrace; • Amy Ruskin, Richard Yannow, and Jameson McCowan, coauthors on other papers; • Daniel Gibbs, Jan Larres, Scott Weston, Bart Jacobs, Charlie Paucard, and Alex Sandilands, other contributors to Minigrace; • Gilad Bracha, Matthias Felleisen, and the other (anonymous) review- ers of papers forming part of this thesis; • the participants in his user study; • David Streader, John Grundy, and Laurence Tratt, examiners of the thesis; • and Alexandra Donnison, Amy Chard, Juanri Barnard, Roma Kla- paukh, and Timothy Jones, for providing feedback on drafts of this thesis.
    [Show full text]
  • Graceful Language Extensions and Interfaces
    Graceful Language Extensions and Interfaces by Michael Homer A thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Doctor of Philosophy Victoria University of Wellington 2014 Abstract Grace is a programming language under development aimed at ed- ucation. Grace is object-oriented, imperative, and block-structured, and intended for use in first- and second-year object-oriented programming courses. We present a number of language features we have designed for Grace and implemented in our self-hosted compiler. We describe the design of a pattern-matching system with object-oriented structure and minimal extension to the language. We give a design for an object-based module system, which we use to build dialects, a means of extending and restricting the language available to the programmer, and of implementing domain-specific languages. We show a visual programming interface that melds visual editing (à la Scratch) with textual editing, and that uses our dialect system, and we give the results of a user experiment we performed to evaluate the usability of our interface. ii ii Acknowledgments The author wishes to acknowledge: • James Noble and David Pearce, his supervisors; • Andrew P. Black and Kim B. Bruce, the other designers of Grace; • Timothy Jones, a coauthor on a paper forming part of this thesis and contributor to Minigrace; • Amy Ruskin, Richard Yannow, and Jameson McCowan, coauthors on other papers; • Daniel Gibbs, Jan Larres, Scott Weston, Bart Jacobs, Charlie Paucard, and Alex Sandilands, other contributors to Minigrace; • Gilad Bracha, Matthias Felleisen, and the other (anonymous) review- ers of papers forming part of this thesis; • the participants in his user study; • and Roma Klapaukh, Juanri Barnard, Alexandra Donnison, Amy Chard, and Timothy Jones for providing feedback on drafts of this thesis.
    [Show full text]
  • Haskell Communities and Activities Report
    Haskell Communities and Activities Report http://www.haskell.org/communities/ Eighth Edition – May 13, 2005 Andres L¨oh (ed.) Perry Alexander Lloyd Allison Tiago Miguel Laureano Alves Krasimir Angelov Alistair Bayley J´er´emy Bobbio Bj¨orn Bringert Niklas Broberg Paul Callaghan Mark Carroll Manuel Chakravarty Olaf Chitil Koen Claessen Catarina Coquand Duncan Coutts Philippa Cowderoy Alain Cr´emieux Iavor Diatchki Atze Dijkstra Shae Erisson Sander Evers Markus Forsberg Simon Foster Leif Frenzel Andr´eFurtado John Goerzen Murray Gross Walter Gussmann Jurriaan Hage Sven Moritz Hallberg Thomas Hallgren Keith Hanna Bastiaan Heeren Anders H¨ockersten John Hughes Graham Hutton Patrik Jansson Johan Jeuring Paul Johnson Isaac Jones Oleg Kiselyov Graham Klyne Daan Leijen Huiqing Li Andres L¨oh Rita Loogen Salvador Lucas Christoph Luth¨ Ketil Z. Malde Christian Maeder Simon Marlow Conor McBride John Meacham Serge Mechveliani Neil Mitchell William Garret Mitchener Andy Moran Matthew Naylor Rickard Nilsson Jan Henry Nystr¨om Sven Panne Ross Paterson Jens Petersen John Peterson Simon Peyton-Jones Jorge Sousa Pinto Bernie Pope Claus Reinke Frank Rosemeier David Roundy George Russell Chris Ryder David Sabel Uwe Schmidt Martijn Schrage Peter Simons Anthony Sloane Dominic Steinitz Donald Bruce Stewart Martin Sulzmann Autrijus Tang Henning Thielemann Peter Thiemann Simon Thompson Phil Trinder Arjan van IJzendoorn Tuomo Valkonen Eelco Visser Joost Visser Malcolm Wallace Ashley Yakeley Jory van Zessen Bulat Ziganshin Preface You are reading the 8th edition of the Haskell Communities and Activities Report (HCAR). These are interesting times to be a Haskell enthusiast. Everyone seems to be talking about darcs (→ 6.3) and Pugs (→ 6.1) these days, and it is nice to see Haskell being mentioned in places where it usually was not.
    [Show full text]
  • Multimedia Applications for Training in Communications
    New technologies for university education PARROT VIRTUAL MACHINE AS A PEDAGOGIC TOOL C. Aperghis-Tramoni, J. Guizol Universite de la Mediterranee For about 20 years now, Perl programming language did develop itself up to the actual release which is 5. Former releases were : Perl 1 : January 1988 Perl 2 : June 1988 Perl 3 : October 1989 Perl 4 : In 992 Perl 5 : Since August 1997 Lets say first some words on how releases are numbered. Three elements have to be considered : Revision. Version. Subversion. It means that, if we consider Perl 5.6.1, Revision is 6, Version is 5 and subversion is 1. Even versions are maintenance one (5.6.x) Odd versions are versions for development (5.7.x) Before reaching 5.6.0, subversions _01 à _49 will have been reserved for debugging. Subversions _50 à _99 are considered as unstable versions. Perl contains a magical variable ($]) that contains the number of the release. This coding uses the composite scheme of numbering in floating point mode. Value is computed as : Revision + Version/1000 + Subversion/10000 Up to now, all these evolutions have never been revolutions, language did remains an interpreted one, only release 5 did propose objects as a new feature. On contrary, the last one, number 6, will bring a radical change in Perl design, it will no more be interpreted but compiled in a byte codes that will be carried out on a virtual machine, the parrot machine.. The simplicity of this machine, the power of its assembly language did decide us to use it as a support for assembly language courses.
    [Show full text]
  • Team Unknown ]
    [ Team Unknown ] Code Quality: The Open Source Perspective By Diomidis Spinellis ............................................... Publisher: Addison Wesley Professional Pub Date: April 03, 2006 Print ISBN-10: 0-321-16607-8 Print ISBN-13: 978-0-321-16607-4 Pages: 608 Slots: 2.0 Table of Contents | Index | Author Index Copyright Effective Software Development Series: Scott Meyers, Consulting Editor List of Tables List of Figures Foreword Preface Chapter 1. Introduction Section 1.1. Software Quality Section 1.2. How to Read This Book Further Reading Chapter 2. Reliability Section 2.1. Input Problems Section 2.2. Output Problems Section 2.3. Logic Problems Section 2.4. Computation Problems Section 2.5. Concurrency and Timing Problems Section 2.6. Interface Problems Section 2.7. Data-Handling Problems Section 2.8. Fault Tolerance Advice to Take Home Further Reading Chapter 3. Security Section 3.1. Vulnerable Code Section 3.2. The Buffer Overflow Section 3.3. Race Conditions Section 3.4. Problematic APIs Section 3.5. Untrusted Input Section 3.6. Result Verification Section 3.7. Data and Privilege Leakage Section 3.8. Trojan Horse Section 3.9. Tools Advice to Take Home Further Reading Chapter 4. Time Performance Section 4.1. Measurement Techniques Section 4.2. Algorithm Complexity Section 4.3. Stand-Alone Code Section 4.4. Interacting with the Operating System Section 4.5. Interacting with Peripherals Section 4.6. Involuntary Interactions Section 4.7. Caching Advice to Take Home Further Reading Chapter 5. Space Performance Section 5.1. Data Section 5.2. Memory Organization Section 5.3. Memory Hierarchies Section 5.4. The Process/Operating System Interface Section 5.5.
    [Show full text]
  • Table of Contents • Index • Reviews • Reader Reviews • Errata Perl 6 Essentials by Allison Randal, Dan Sugalski, Leopold Tötsch
    • Table of Contents • Index • Reviews • Reader Reviews • Errata Perl 6 Essentials By Allison Randal, Dan Sugalski, Leopold Tötsch Publisher: O'Reilly Pub Date: June 2003 ISBN: 0-596-00499-0 Pages: 208 Slots: 1 Perl 6 Essentials is the first book that offers a peek into the next major version of the Perl language. Written by members of the Perl 6 core development team, the book covers the development not only of Perl 6 syntax but also Parrot, the language-independent interpreter developed as part of the Perl 6 design strategy. This book is essential reading for anyone interested in the future of Perl. It will satisfy their curiosity and show how changes in the language will make it more powerful and easier to use. 1 / 155 • Table of Contents • Index • Reviews • Reader Reviews • Errata Perl 6 Essentials By Allison Randal, Dan Sugalski, Leopold Tötsch Publisher: O'Reilly Pub Date: June 2003 ISBN: 0-596-00499-0 Pages: 208 Slots: 1 Copyright Preface How This Book Is Organized Font Conventions We'd Like to Hear from You Acknowledgments Chapter 1. Project Overview Section 1.1. The Birth of Perl 6 Section 1.2. In the Beginning . Section 1.3. The Continuing Mission Chapter 2. Project Development Section 2.1. Language Development Section 2.2. Parrot Development Chapter 3. Design Philosophy Section 3.1. Linguistic and Cognitive Considerations Section 3.2. Architectural Considerations Chapter 4. Syntax Section 4.1. Variables Section 4.2. Operators Section 4.3. Control Structures Section 4.4. Subroutines Section 4.5. Classes and Objects Section 4.6.
    [Show full text]