Phd Thesis, Huntsville, AL, USA, 2005

Total Page:16

File Type:pdf, Size:1020Kb

Phd Thesis, Huntsville, AL, USA, 2005 Architectural Support for Security and Reliability in Embedded Processors by Roshan G. Ragel B.Sc.Eng. (Hons), MIEEE(USA), MIET(UK), AMIE(SL) A Dissertation Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy August 2006 Copyright c 2006 by Roshan G. Ragel All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without the prior permission of the author. Author’s e-mail: [email protected] ORIGINALITY STATEMENT ‘I hereby declare that this submission is my own work and to the best of my knowledge it contains no materials previously published or written by another person, or substantial proportions of material which have been accepted for the award of any other degree or diploma at UNSW or any other educational institution, except where due acknowledgement is made in the thesis. Any contribution made to the research by others, with whom I have worked at UNSW or elsewhere, is explicitly acknowledged in the thesis. I also declare that the intellectual content of this thesis is the product of my own work, except to the extent that assistance from others in the project’s design and conception or in style, presentation and linguistic expression is acknowledged.’ Signed : (Roshan G. Ragel) Date : 31-07-2007 COPYRIGHT STATEMENT ‘I hereby grant the University of New South Wales or its agents the right to archive and to make available my thesis or dissertation in whole or part in the University libraries in all forms of media, now or here after known, subject to the provisions of the Copyright Act 1968. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation. I also authorise University Microfilms to use the 350 word abstract of my thesis in Dissertation Abstract International (this is applicable to doctoral theses only). I have either used no substantial portions of copyright material in my thesis or I have obtained permission to use copyright material; where permission has not been granted I have applied/will apply for a partial restriction of the digital copy of my thesis or dissertation.' Signed : Date : 31/07/2007 AUTHENTICITY STATEMENT ‘I certify that the Library deposit digital copy is a direct equivalent of the final officially approved version of my thesis. No emendation of content has occurred and if there are any minor variations in formatting, they are the result of the conversion to digital format.’ Signed : Date : 31/07/2007 To the memories of all my Teachers... Abstract Security and reliability in processor based systems are concerns requiring adroit solutions. Security is often compromised by code injection attacks, jeopardizing even ‘trusted soft- ware’. Reliability is of concern, where unintended code is executed in modern processors with ever smaller feature sizes and low voltage swings causing bit flips. Countermeasures by software-only approaches increase code size and therefore significantly reduce perfor- mance. Hardware assisted approaches use additional hardware monitors and thus incur considerably high hardware cost and have scalability problems. Considering reliability and security issues during the design of an embedded system has its advantages as this overcomes the limitations of existing solutions. The research work presented in this thesis combines two elements: one, defining a hard- ware software design framework for reliability and security monitoring at the granularity of micro-instructions, and two, applying this framework for real world problems. At a given time, a processor executes only a few instructions and large part of the processor is idle. Utilizing these idling hardware components by sharing them with the monitoring hardware, to perform security and reliability monitoring reduces the impact of the moni- tors on hardware cost. Using micro-instruction routines within the machine instructions, allows us to share most of the monitoring hardware. Therefore, our technique requires little hardware overhead in comparison to having additional hardware blocks outside the processor. This reduction in overhead is due to maximal sharing of hardware resources of the processor. Our framework is superior to software-only techniques as the monitoring i routines are formed with micro-instructions and therefore reduces code size and execution time overheads, since they occur in parallel with machine instructions. This dissertation makes four significant contributions to the field of security and relia- bility on embedded processor research and they are: (i) proposed a security and relia- bility framework for embedded processors that could be included into its design phase; (ii) shown that inline (machine instruction level) monitoring will detect common secu- rity attacks (four inline monitors against common attacks cost 9.21% area and 0.67% performance, as opposed to previous work where an external monitor with two monitor- ing modules costs 15% area overhead); (iii) illustrated that basic block check-summing for code integrity is much simpler and efficient than currently proposed integrity viola- tion detectors which address code injection attacks (this costs 5.03% area increase and 3.67% performance penalty with a single level control flow checking, as opposed to pre- vious work where the area overhead is 5.59%, which needed three control flow levels of integrity checking); and (iv) shown that hardware assisted control flow checking imple- mented during the design of a processor is much cheaper and effective than software only approaches (this approach costs 0.24-1.47% performance and 3.59% area overheads, as opposed to previous work that costs 53.5-99.5% performance). Acknowledgements ... ‘I can’t explain myself, I’m afraid, Sir, because I’m not myself you see’ .. — Lewis Carroll, Alice’s Adventures in Wonderland have been fortunate enough to meet and be with many wonderful people over the years, who have given me their time, companionship, friendship and professional, moral and personal helps. It is Itime to recall and acknowledge all of them at this special moment of time. First I must thank the Department of Education, Science and Training, Australia (DEST), for fund- ing my research through the Endeavour International Postgraduate Research Scholarship (EIPRS). I am also grateful to National Information and Communications Technology Australia (NICTA) and Faculty of Engineering, University of New South Wales for their additional support. Now, I would first like to thank my supervisor, Sri Parameswaran. He not only gave me the tech- nical support and supervision that a graduate student could expect from his supervisor, but he also encouraged and gave moral support without which I would never have made it this far. Seyed Mohammad Kia, of Abbaspour University has co-authored two of my papers. His companion- ability and the nature of taking everything positive have for sure made me a better researcher. I should thank him for his time, effort and everything else. Many thanks to the following academic giants for being in my PhD review panels: Aleksandar Ignja- tovic, Oliver Frank Diessel and Kevin John Elphinstone. Their comments and feedbacks have always been valuable and beneficial and have enhanced my thesis into the right direction. Ravishankar Iyer, of University of Illinois at Urbana Champaign allowed me to spend couple of months with his group at Coordinated Science Laboratory. It was a fruitful experience for me and I take this opportunity to thank him and other researchers in his group, particularly Zbigniew Kalbar- czyk, Nithin Nakka, Weining Gu, Shuo Chen and Karthik Pattabiraman. A list that, alas, has far too many names on it to mention separately is that of all researchers and colleagues at Embedded Systems Laboratory (ESL), University of New South Wales - my working place. It was pleasure, fun and stimulating of being in such an environment and I am definitely sure iii iv Acknowledgements that I am going to miss them all. All the insightful conversations we exchanged over the past couple of years had made my stay at ESL a delightful experience. Thanks go out also to my thesis examiners, for their time that they spent on reviewing my writing, their valuable feedbacks and comments and their efforts on evaluating it. I would like to thank my parents who are in Sri Lanka and brother for their unconditional love, patience and support. I definitely missed them all during my stay in Sydney to pursue my PhD. I also would like to thank all my friends (you all know who you are!) for their help, friendship, understanding and patience. Finally, I would like to extend my thanks to all the researchers around the world, who are working on computer architecture, security and reliability whose work have motivated me in many aspects. Particularly, all the reviewers and editors of my papers for their priceless efforts and feedbacks. Table of Contents List of Figures xi List of Tables xv 1 Introduction 1 1.1 About this Chapter ............................. 1 1.1.1 Objectives .............................. 1 1.1.2 Contributions ............................ 2 1.2 Embedded Systems and Security ...................... 2 1.3 Embedded Systems and Reliability ..................... 7 1.4 Organization of the Thesis ......................... 14 1.5 Summary of this chapter .......................... 15 2 Security and Reliability Issues 17 2.1 About this Chapter ............................. 17 2.1.1 Objectives .............................. 17 2.1.2 Outline ............................... 18 2.1.3 Contributions ............................ 18 2.2 Security Issues ................................ 18 2.3 Code Injection Attacks ........................... 22 2.3.1 Stack-based buffer overflows .................... 22 2.3.2 Heap-based buffer overflows .................... 26 2.3.3 Exploiting double-free vulnerability ................ 31 2.3.4 Integer errors ............................ 34 2.3.5 Exploiting format string vulnerabilities ............... 37 2.4 Reliability Issues .............................
Recommended publications
  • Ragel State Machine Compiler User Guide
    Ragel State Machine Compiler User Guide by Adrian Thurston License Ragel version 6.3, August 2008 Copyright c 2003-2007 Adrian Thurston This document is part of Ragel, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Ragel is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PUR- POSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Ragel; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA i Contents 1 Introduction 1 1.1 Abstract...........................................1 1.2 Motivation.........................................1 1.3 Overview..........................................2 1.4 Related Work........................................4 1.5 Development Status....................................5 2 Constructing State Machines6 2.1 Ragel State Machine Specifications............................6 2.1.1 Naming Ragel Blocks...............................7 2.1.2 Machine Definition.................................7 2.1.3 Machine Instantiation...............................7 2.1.4 Including Ragel Code...............................7 2.1.5 Importing Definitions...............................7 2.2 Lexical Analysis of a Ragel Block.............................8
    [Show full text]
  • Mda13:Hpg-Variant-Developers.Pdf
    Overview Global schema: Binaries HPG Variant VCF Tools HPG Variant Effect HPG Variant GWAS Describing the architecture by example: GWAS Main workflow Reading configuration files and command-line options Parsing input files Parallelization schema How to compile: Dependencies and application Hacking HPG Variant Let's talk about... Global schema: Binaries HPG Variant VCF Tools HPG Variant Effect HPG Variant GWAS Describing the architecture by example: GWAS Main workflow Reading configuration files and command-line options Parsing input files Parallelization schema How to compile: Dependencies and application Hacking HPG Variant Binaries: HPG Variant VCF Tools HPG Variant VCF Tools preprocesses VCF files I Filtering I Merging I Splitting I Retrieving statistics Binaries: HPG Variant Effect HPG Variant Effect retrieves information about the effect of mutations I Querying a web service I Uses libcurl (client side) and JAX-RS/Jersey (server side) I Information stored in CellBase DB Binaries: HPG Variant GWAS HPG Variant GWAS conducts genome-wide association studies I Population-based: Chi-square, Fisher's exact test I Family-based: TDT I Read genotypes from VCF files I Read phenotypes and familial information from PED files Let's talk about... Global schema: Binaries HPG Variant VCF Tools HPG Variant Effect HPG Variant GWAS Describing the architecture by example: GWAS Main workflow Reading configuration files and command-line options Parsing input files Parallelization schema How to compile: Dependencies and application Hacking HPG Variant Architecture: Main workflow
    [Show full text]
  • UNIVERSITY of TRENTO Degree Course in Computer
    UNIVERSITY OF TRENTO Department of Information Engineering and Computer Science Degree course in Computer Science Final Thesis GHERKIN* AND CUCUMBER* ANEWTESTCASEPATHCOMPOSITIONAPPROACH TO TESTING RUBY ON RAILS WEB APPLICATIONS Supervisor: Graduant: Prof. Maurizio Marchese Roberto Zen Co-Supervisor: Prof. Adolfo Villafiorita Academic year 2013-2014 Ai miei genitori A mio fratello Acknowledgements I would like to thank my supervisor Maurizio Marchese for his encourage- ment and support during the writing of this composition. My work would have never been carried out without the help of the whole ICT4G Unit of Fondazione Bruno Kessler. In particular, I would like to thank Prof. Adolfo Villafiorita for his help and his patience with me during these last two years. You are a mentor for me. Thanks also to Prof. Alberto Montresor for the useful discussion we had. Thanks to my family for supporting me during my studies. I want to sincerely express my gratitude and thanks to my best friends: Stefano, Sara, Sveva and Antonio. I also acknowledge my roommates and friends: Victor, Damiano and Diego. I would like also to thank all my friends, particularly Mirko Za↵aroni, Gio- vanni Bonetta, Andrea Sosi, Giovanni De Francesco, Giulio Fornasaro, Luca Zamboni, Amedeo Calafiore, Andrea Balzan, Chiara Salvagno, Lucia Pilat, Anna Giamosa and Federica Stetka. Contents Abstract iv 1 Introduction 1 1.1 Motivations . 3 1.2 Goals . 3 1.3 Results............................... 3 1.4 Outline .............................. 4 2 State of the art 5 2.1 Introduction............................ 5 2.2 Ruby and its approach to testing . 5 2.3 RSpec and Capybara . 6 2.4 Gherkin .............................
    [Show full text]
  • Ragel State Machine Compiler User Guide
    Ragel State Machine Compiler User Guide by Adrian Thurston License Ragel version 6.6, Dec 2009 Copyright c 2003-2007 Adrian Thurston This document is part of Ragel, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Ragel is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PUR- POSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Ragel; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA i Contents 1 Introduction 1 1.1 Abstract...........................................1 1.2 Motivation.........................................1 1.3 Overview..........................................2 1.4 Related Work........................................4 1.5 Development Status....................................5 2 Constructing State Machines6 2.1 Ragel State Machine Specifications............................6 2.1.1 Naming Ragel Blocks...............................7 2.1.2 Machine Definition.................................7 2.1.3 Machine Instantiation...............................7 2.1.4 Including Ragel Code...............................7 2.1.5 Importing Definitions...............................7 2.2 Lexical Analysis of a Ragel Block.............................8 2.3 Basic Machines.......................................8 2.4 Operator Precedence.................................... 11 2.5 Regular Language Operators............................... 11 2.5.1 Union........................................ 12 2.5.2 Intersection..................................... 12 2.5.3 Difference...................................... 13 2.5.4 Strong Difference.................................. 13 2.5.5 Concatenation................................... 14 2.5.6 Kleene Star....................................
    [Show full text]
  • Spirit 2.1 Joel De Guzman Hartmut Kaiser Copyright © 2001-2009 Joel De Guzman, Hartmut Kaiser
    Spirit 2.1 Joel de Guzman Hartmut Kaiser Copyright © 2001-2009 Joel de Guzman, Hartmut Kaiser Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Table of Contents Preface ................................................................................................................................................................. 3 What's New .......................................................................................................................................................... 6 Introduction .......................................................................................................................................................... 8 Structure ............................................................................................................................................................. 13 Include ....................................................................................................................................................... 13 Abstracts ............................................................................................................................................................ 15 Syntax Diagram ........................................................................................................................................... 15 Parsing Expression Grammar .........................................................................................................................
    [Show full text]
  • Writing Parsers Like It Is 2017
    Writing parsers like it is 2017 Pierre Chifflier1 and Geoffroy Couprie2 [email protected] [email protected] 1 ANSSI 2 Clever Cloud Abstract. Despite being known since a long time, memory violations are still a very important cause of security problems in low-level programming languages containing data parsers. We address this problem by proposing a pragmatic solution to fix not only bugs, but classes of bugs. First, using a fast and safe language such as Rust, and then using a parser combinator. We discuss the advantages and difficulties of this solution, and we present two cases of how to implement safe parsers and insert them in large C projects. The implementation is provided as a set of parsers and projects in the Rust language. 1 Introduction 1.1 Manipulating data and related problems In 2016, like every year for a long time, memory corruption bugs have been one of the first causes of vulnerabilities of compiled programs [2]. When looking at the C programming language, many errors lead to memory corruption: buffer overflow, use after free, double free, etc. Some of these issues can be complicated to diagnose, and the consequence is that a huge quantity of bugs is hidden in almost all C software. Any software manipulating untrusted data is particularly exposed: it needs to parse and interpret data that can be controlled by the attacker. Unfortunately, data parsing is often done in a very unsafe way, especially for network protocols and file formats. For example, many bugs were discovered in media parsing libraries in Android [12], leading to the possible remote exploitation of all devices by a simple MMS message.
    [Show full text]
  • Ragel State Machine Compiler User Guide
    Ragel State Machine Compiler User Guide by Adrian Thurston License Ragel version 5.16, November 2006 Copyright c 2003, 2004, 2005, 2006 Adrian Thurston This document is part of Ragel, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Ragel is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Ragel; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA i Contents 1 Introduction 1 1.1 Abstract . 1 1.2 Motivation . 1 1.3 Overview . 2 1.4 Related Work . 4 1.5 Development Status . 5 2 Constructing State Machines 7 2.1 Ragel State Machine Specifications . 7 2.1.1 Naming Ragel Blocks . 7 2.1.2 Including Ragel Code . 8 2.1.3 Machine Definition . 8 2.1.4 Machine Instantiation . 8 2.2 Lexical Analysis of an FSM Specification . 9 2.3 Basic Machines . 9 2.4 Operator Precedence . 12 2.5 Regular Language Operators . 12 2.5.1 Union . 13 2.5.2 Intersection . 14 2.5.3 Difference . 14 2.5.4 Strong Difference . 15 2.5.5 Concatenation . 15 2.5.6 Kleene Star . 16 2.5.7 One Or More Repetition .
    [Show full text]
  • Ragel State Machine Compiler User Guide
    Ragel State Machine Compiler User Guide by Adrian Thurston License Ragel version 6.9, Oct 2014 Copyright c 2003-2007 Adrian Thurston This document is part of Ragel, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Ragel is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PUR- POSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Ragel; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA i Contents 1 Introduction 1 1.1 Abstract...........................................1 1.2 Motivation.........................................1 1.3 Overview..........................................2 1.4 Related Work........................................4 1.5 Development Status....................................5 2 Constructing State Machines6 2.1 Ragel State Machine Specifications............................6 2.1.1 Naming Ragel Blocks...............................7 2.1.2 Machine Definition.................................7 2.1.3 Machine Instantiation...............................7 2.1.4 Including Ragel Code...............................7 2.1.5 Importing Definitions...............................7 2.2 Lexical Analysis of a Ragel Block.............................8 2.3 Basic Machines.......................................8 2.4 Operator Precedence.................................... 11 2.5 Regular Language Operators............................... 11 2.5.1 Union........................................ 12 2.5.2 Intersection..................................... 12 2.5.3 Difference...................................... 13 2.5.4 Strong Difference.................................. 13 2.5.5 Concatenation................................... 14 2.5.6 Kleene Star....................................
    [Show full text]
  • Ragel State Machine Compiler User Guide
    Ragel State Machine Compiler User Guide by Adrian Thurston License Ragel version 5.21, May 2007 Copyright c 2003-2007 Adrian Thurston This document is part of Ragel, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Ragel is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PUR- POSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Ragel; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA i Contents 1 Introduction 1 1.1 Abstract . 1 1.2 Motivation . 1 1.3 Overview . 2 1.4 Related Work . 4 1.5 Development Status . 5 2 Constructing State Machines 6 2.1 Ragel State Machine Specifications . 6 2.1.1 Naming Ragel Blocks . 7 2.1.2 Including Ragel Code . 7 2.1.3 Importing Definitions . 7 2.1.4 Machine Definition . 7 2.1.5 Machine Instantiation . 7 2.2 Lexical Analysis of a Ragel Block . 8 2.3 Basic Machines . 8 2.4 Operator Precedence . 10 2.5 Regular Language Operators . 11 2.5.1 Union . 12 2.5.2 Intersection . 12 2.5.3 Difference . 13 2.5.4 Strong Difference . 13 2.5.5 Concatenation . 14 2.5.6 Kleene Star .
    [Show full text]
  • Syntax (Pre Lecture)
    Syntax (Pre Lecture) Dr. Neil T. Dantam CSCI-400, Colorado School of Mines Spring 2021 Dantam (Mines CSCI-400) Syntax (Pre Lecture) Spring 2021 1 / 36 Introduction Introduction Outcomes I Syntax: what programs we can write I Know basic definitions of formal / what the language \looks like" language theory I Semantics: what these programs I Understand parse trees and abstract means / what the language does syntax trees (more later in the course) I Design grammars for common I concrete syntax { human-readable programming language constructs I abstract syntax { encoded for use by interpreter/compiler I Formal language: mathematical basis to represent and analyze syntax Dantam (Mines CSCI-400) Syntax (Pre Lecture) Spring 2021 2 / 36 Front-end text Phases of Interpretation/Compilation Front-end text Lexical Analysis I Analysis: Front-end terminal sequence I Lexical: convert text to terminals, Syntax Analysis aka lexing, scanning abstract syntax tree I Syntax: convert terminals to syntax tree aka parsing Semantic Analysis I Semantic: check or infer types annotated syntax tree aka type checking, type inference I Synthesis: Back-end I Compiler: Construct machine code I Interpreter: Execute the program Back-end machine code Dantam (Mines CSCI-400) Syntax (Pre Lecture) Spring 2021 3 / 36 Phases of Analysis ``foo+bar*bif'' Lexical Analysis [foo; +; bar; ∗; bif] Syntax Analysis + foo ∗ bar bif + : float foo : float ∗ : int Semantic Analysis bar : int bif : int Dantam (Mines CSCI-400) Syntax (Pre Lecture) Spring 2021 4 / 36 Automatically Generating Code
    [Show full text]
  • Kleene Meets Church
    FACULTY OF SCIENCE UNIVERSITY OF COPENHAGEN Kleene Meets Church Ordered Finite Action Transducers for High-Performance Stream Processing Kristoffer Aalund Søholm Sebastian Paaske Tørholm July 17, 2015 Abstract Efficient methods for regular string matching are well known, while the problem of regular string transduction (rewriting) is less explored. We introduce ordered finite action transducers (OFAT), building on the theory of streaming string transducers (SST) to produce an efficient two-phase transducer with good streaming behavior, that allows for execution of arbitrarily complex actions along the parsed path. We describe Kleenex, a programming language for expressing string transductions, and introduce a formalization to an OFAT with a limited subset of actions for which we can prove a worst case linear transduction time for fixed size automata. We also describe repg, an implementation of the Kleenex language, and its compilation process. In use cases we achieve good performance characteristics compared to both similar tools such as DReX and Ragel, as well as related tools such as RE2, PCRE and other regular expression libraries. Thesis supervisor: Fritz Henglein 1 2 Acknowledgements We would like to thank our thesis supervisor Fritz Henglein, as well as Niels Bjørn Bugge Grathwohl and Ulrik Rasmussen, Ph.D. students associated with the KMC project, for their excellent supervision and support during the entire project. We would also like to thank Mathias Bundgaard Svensson, Rasmus Wriedt Larsen, and René Løwe Jacobsen for their help with proofreading our thesis. Contents Contents3 List of Figures5 List of Tables6 List of Theorems7 1 Introduction8 2 Preliminaries 11 2.1 Regular expressions........................... 11 2.2 Finite automata...........................
    [Show full text]
  • Sample Chapter
    TABLE OF CONTENT 1. Table of Content 2. Introduction 1. Summary 2. About The Author 3. Before We Begin 3. Overview 1. The Four Parts of a Language 2. Meet Awesome: Our Toy Language 4. Lexer 1. Lex (Flex) 2. Ragel 3. Python Style Indentation For Awesome 4. Do It Yourself I 5. Parser 1. Bison (Yacc) 2. Lemon 3. ANTLR 4. PEGs 5. Operator Precedence 6. Connecting The Lexer and Parser in Awesome 7. Do It Yourself II 6. Runtime Model 1. Procedural 2. Class-based 3. Prototype-based 4. Functional 5. Our Awesome Runtime 6. Do It Yourself III 7. Interpreter 1. Evaluating The Nodes in Awesome 2. Do It Yourself IV 8. Virtual Machine 1. Byte-code 2. The Stack 3. Prototyping a VM in Ruby 9. Compilation 1. Compiling to Byte-code 2. Compiling to Machine Code 10. Mio, a minimalist homoiconic language 1. Homoicowhat? 2. Messages all the way down 3. The Runtime 4. Implementing Mio in Mio 5. But it’s ugly 11. Going Further 1. Homoiconicity 2. Self-Hosting 3. What’s Missing? 12. Resources 1. Books & Papers 2. Events 3. Forums and Blogs 4. Classes 5. Interesting Languages 13. Farewell! 14. Solutions to Do It Yourself 1. Solutions to Do It Yourself I 2. Solutions to Do It Yourself II 3. Solutions to Do It Yourself III 4. Solutions to Do It Yourself IV Revision #5, Published June 2013. Cover background image © Asja Boros Content of this book is © Marc-André Cournoyer. All right reserved. This eBook copy is for a single user.
    [Show full text]