Micropatterns in Grammars
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Recovery, Convergence and Documentation of Languages
Recovery, Convergence and Documentation of Languages by Vadim Zaytsev September 14, 2010 VRIJE UNIVERSITEIT Recovery, Convergence and Documentation of Languages ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad Doctor aan de Vrije Universiteit Amsterdam, op gezag van de rector magnificus prof.dr. L.M. Bouter, in het openbaar te verdedigen ten overstaan van de promotiecommissie van de faculteit der Exacte Wetenschappen op woensdag 27 oktober 2010 om 15.45 uur in de aula van de universiteit, De Boelelaan 1105 door Vadim Valerievich Zaytsev geboren te Rostov aan de Don, Rusland promotoren: prof.dr. R. Lammel¨ prof.dr. C. Verhoef Dit onderzoek werd ondersteund door de Nederlandse Organisatie voor Wetenschappelijk Onderzoek via: This research has been sponsored by the Dutch Organisation of Scientific Research via: NWO 612.063.304 LPPR: Language-Parametric Program Restructuring Acknowledgements Working on a PhD is supposed to be an endeavour completed in seclusion, but in practice one cannot survive without the help and support from others, fruitful scientific discus- sions, collaborative development of tools and papers and valuable pieces of advice. My work was supervised by Prof. Dr. Ralf Lammel¨ and Prof. Dr. Chris Verhoef, who often believed in me more than I did and were always open to questions and ready to give expert advice. They have made my development possible. LPPR colleagues — Jan Heering, Prof. Dr. Paul Klint, Prof. Dr. Mark van den Brand — have been a rare yet useful source of new research ideas. All thesis reading committee members have dedicated a lot of attention to my work and delivered exceptionally useful feedback on the late stage of the research: Prof. -
Recovery, Convergence and Documentation of Languages Zaytsev, V.V
VU Research Portal Recovery, Convergence and Documentation of Languages Zaytsev, V.V. 2010 document version Publisher's PDF, also known as Version of record Link to publication in VU Research Portal citation for published version (APA) Zaytsev, V. V. (2010). Recovery, Convergence and Documentation of Languages. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. E-mail address: [email protected] Download date: 25. Sep. 2021 VRIJE UNIVERSITEIT Recovery, Convergence and Documentation of Languages ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad Doctor aan de Vrije Universiteit Amsterdam, op gezag van de rector magnificus prof.dr. L.M. Bouter, in het openbaar te verdedigen ten overstaan van de promotiecommissie van de faculteit der Exacte Wetenschappen op woensdag 27 oktober 2010 om 15.45 uur in de aula van de universiteit, De Boelelaan 1105 door Vadim Valerievich Zaytsev geboren te Rostov aan de Don, Rusland promotoren: prof.dr. -
Substitution Notation X 1932 Alonzo Church Uses the Notation SY U| for Substitution in a Formula
It’s Time for a New Old Language Guy L. Steele Jr. Software Architect, Oracle Labs MIT 6.945 Guest Lecture Wednesday, April 5, 2017 Copyright © 2017 Oracle and/or its affiliates (“Oracle”). All rights are reserved by Oracle except as ex- pressly stated as follows. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted, provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or re- publish, to post on servers, or to redistribute to lists, requires prior specific written permission of Oracle. Copyright ◦c 2017 Oracle and/or its affiliates. All rights reserved. The most popular programming language in computer science Copyright ◦c 2017 Oracle and/or its affiliates. All rights reserved. 4 Some Early Contributors Gerhard John Peter Alonzo Gentzen Backus Naur Church Copyright ◦c 2017 Oracle and/or its affiliates. All rights reserved. 5 Computer Science Metanotation (CSM) • Built-in datatypes: boolean, integer, real, complex, sets, lists, arrays • User-declared datatypes: record/ abstract data type/ symbolic expression (BNF= Backus-Naur Form) • Code: Inference rules(Gentzen notation) • Conditionals: rule dispatch via nondeterministic pattern-matching • Repetition: overlines and/or ellipsis notations, and sometimes iterators • Primitive expressions: logic and mathematics • Capture-free substitution within a symbolic expression (Church) Copyright ◦c 2017 Oracle and/or its affiliates. -
Parsing and Evaluating Mathematical Expressions in Object Pascal
Parsing and Evaluating Mathematical Expressions in Object Pascal Michel Deslierres [email protected] 2016-07-28 http://www.sigmdel.ca Version 1.0 There are two versions of this text on parsing and evaluating mathematical expressions. The original and incomplete version describes parsers written with Embarcadero’s Delphi. It is still available. This version describes the source code that compiles with Free Pascal 2.6.4 or better. The two versions are not much different. Porting to Free Pascal required treating floating point exceptions at the very beginning. National language support is also different. Finally, dynamic arrays are used in the Free Pascal version which would mean that the code would not compile under the now very old version 2 (circa 1995) of Delphi. Table des matières 1 Introduction.............................................................................................................................3 1.1 Translating Text...............................................................................................................3 1.2 Source Code and License................................................................................................5 2 Parsing a Simplified Grammar................................................................................................7 2.1 Simple Grammar.............................................................................................................7 2.2 Recursive Descent Parsing..............................................................................................9