DOCSLIB.ORG

List of Programming Languages

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
List of Programming Languages List of programming languages The aim of this list of programming languages is to include all notable programming languages in existence, both those in current use and historical ones, in alphabetical order. Dialects of BASIC, esoteric programming languages, and markup languages are not included. 0–9ABCDEFGHIJKLMNOPQRSTUVWXYZ Contents: See also A A.NET ALGOL W A-0 System Alice A+ Alma-0 ABAP AmbientTalk ABC Amiga E ABC ALGOL AMOS ACC AMPL Accent AngelScript Ace DASL (Distributed Application Apache Pig latin Specification Language) Apex Action! APL ActionScript App Inventor for Android's visual block Actor language Ada AppleScript Adenine APT Agda Arc Agilent VEE ARexx Agora Argus AIMMS Assembly language Aldor AutoHotkey Alef AutoIt ALF AutoLISP / Visual LISP ALGOL 58 Averest ALGOL 60 AWK ALGOL 68 Axum B B BASIC Babbage Batch file (Windows/MS-DOS) Ballerina bc Bash BCPL BeanShell BlooP Bertrand Boo BETA Boomerang BLISS Bosque Blockly C C – ISO/IEC 9899 CLU C-- (C minus minus) CMS-2 C++ (C plus plus) – ISO/IEC 14882 COBOL – ISO/IEC 1989 C* CobolScript – COBOL Scripting language C# (C sharp) – ISO/IEC 23270 Cobra C/AL CoffeeScript Caché ObjectScript ColdFusion C Shell (csh) COMAL Caml Combined Programming Language (CPL) Cayenne COMIT CDuce Common Intermediate Language (CIL) Cecil Common Lisp (also known as CL) Cesil COMPASS Céu Component Pascal Ceylon Constraint Handling Rules (CHR) CFEngine COMTRAN Cg Cool Ch Coq Chapel Coral 66 Charm CorVision CHILL COWSEL CHIP-8 CPL chomski Cryptol ChucK Crystal Cilk Csound CL (IBM) Cuneiform Claire Curl Clarion Curry Clean Cybil Clipper Cyclone CLIPS Cypher Query Language CLIST Cython Clojure CEEMAC D D Dart Darwin DIBOL DataFlex Dog Datalog Draco DATATRIEVE DRAKON dBase Dylan dc DYNAMO DCL DAX (Data Analysis Expressions) DinkC E E EPL (Eltron Programming Language) Ease Erlang Easy PL/I es EASYTRIEVE PLUS Escher eC ESPOL ECMAScript Esterel Edinburgh IMP Etoys EGL Euclid Eiffel Euler ELAN Euphoria Elixir EusLisp Robot Programming Language Elm CMS EXEC (EXEC) Emacs Lisp EXEC 2 Emerald Executable UML Epigram Ezhil EPL (Easy Programming Language) F F FOCAL F# FOCUS F* FOIL Factor FORMAC Fantom @Formula FAUST Forth FFP Fortran – ISO/IEC 1539 fish Fortress Fjölnir FP FL Franz Lisp Flavors FreeBasic Flex Futhark FlooP F-Script FLOW-MATIC G Game Maker Language (Scripting language) Go! GameMonkey Script GOAL GAMS Gödel GAP Golo G-code GOM (Good Old Mad) GDScript Google Apps Script Genie Gosu GDL GOTRAN GEORGE GPSS GLSL GraphTalk GNU E GRASS GNU Guile Grasshopper Go Groovy H Hack High Level Assembly HAGGIS HLSL HAL/S Hollywood Halide (programming language) HolyC Hamilton C shell Hop Harbour Hopscotch Hartmann pipelines Hope Haskell Hugo Haxe Hume Hermes HyperTalk I Io IBM RPG Icon IDL IBM Basic assembly language Idris IBM HAScript Inform IBM Informix-4GL J J Janus (concurrent constraint programming J# language) J++ Janus (time-reversible computing JADE programming language) JAL JASS Java JavaFX Script Joule JavaScript(Scripting language) JOVIAL Jess (programming language) Joy JCL JScript JEAN JScript .NET Join Java Julia JOSS Jython K K Kotlin Kaleidoscope KRC Karel KRL KEE KRL (KUKA Robot Language) Kixtart KRYPTON Klerer-May System Korn shell (ksh) KIF Kodu Kojo Kv L LabVIEW Lisp – ISO/IEC 13816 Ladder Lite-C LANSA Lithe Lasso Little b Lava LLL LC-3 Logo Lean Logtalk Legoscript LotusScript LIL LPC LilyPond LSE Limbo LSL Limnor LiveCode LINC LiveScript Lingo Lua LINQ Lucid LIS Lustre LISA LYaPAS Language H Lynx M M2001 Machine code M4 MAD (Michigan Algorithm Decoder) M# MAD/I Magik MIIS Magma Milk (programming language) Máni MIMIC Maple Mirah MAPPER (now part of BIS) Miranda MARK-IV (now VISION:BUILDER) MIVA Script Mary ML MATLAB Model 204 MASM Microsoft Assembly x86 Modelica MATH-MATIC Modula Maude system Modula-2 Maxima (see also Macsyma) Modula-3 Max (Max Msp – Graphical Programming Mohol Environment) MOO MaxScript internal language 3D Studio Max Mortran Maya (MEL) Mouse MDL MPD Mercury MSL Mesa MUMPS MHEG-5 (Interactive TV programming MuPAD language) Mutan Microcode Mystic Programming Language (MPL) MicroScript N NASM Nial Napier88 Nickle (NITIN) Neko Nim Nemerle Nix (Systems configuration language) NESL NPL Net.Data Not eXactly C (NXC) NetLogo Not Quite C (NQC) NetRexx NSIS NewLISP Nu NEWP NWScript Newspeak NXT-G NewtonScript O o:XML Object Lisp Oak ObjectLOGO Oberon Object REXX OBJ2 Object Pascal Objective-C OpenEdge ABL Objective-J OPL Obliq OpenVera OCaml OPS5 occam OptimJ occam-π Orc Octave ORCA/Modula-2 OmniMark Oriel Opa Orwell Opal Oxygene OpenCL Oz P P PL360 P4 PLANC P′′ Plankalkül ParaSail (programming language) Planner PARI/GP PLEX Pascal – ISO 7185 PLEXIL Pascal Script Plus PCASTL POP-11 PCF POP-2 PEARL PostScript PeopleCode PortablE Perl POV-Ray SDL PDL Powerhouse Pharo PowerBuilder – 4GL GUI application PHP generator from Sybase Pico PowerShell Picolisp PPL Pict Processing Pike Processing.js PILOT Prograph Pipelines PROIV Pizza Prolog PL-11 PROMAL PL/0 Promela PL/B PROSE modeling language PL/C PROTEL PL/I – ISO 6160 ProvideX PL/M Pro*C PL/P Pure PL/SQL Pure Data PureScript Python Q Q (programming language from Kx Systems) QtScript Q# (Microsoft programming language) QuakeC Qalb QPL Quantum Computation Language .QL R R Redcode R++ REFAL Racket REXX Raku Rlab RAPID ROOP Rapira RPG Ratfiv RPL Ratfor RSL rc RTL/2 Reason Ruby REBOL Rust Red S S Self S2 SenseTalk S3 SequenceL S-Lang Serpent S-PLUS SETL SA-C SIMPOL SabreTalk SIGNAL SAIL SiMPLE SAS SIMSCRIPT SASL Simula Sather Simulink Sawzall Singularity Scala SISAL Scheme SLIP Scilab SMALL Scratch Smalltalk Script.NET SML Sed Strongtalk Seed7 Snap! SNOBOL (SPITBOL) Squirrel Snowball SR SOL S/SL Solidity Starlogo SOPHAEROS Strand Source Stata SPARK Stateflow Speakeasy Subtext Speedcode SBL SPIN SuperCollider SP/k SuperTalk SPS Swift (Apple programming language) SQL Swift (parallel scripting language) SQR SYMPL Squeak SystemVerilog T T Toi TACL Topspeed TACPOL TPU TADS Trac TAL TTM Tcl T-SQL Tea Transcript TECO TTCN TELCOMP Turing TeX TUTOR TEX TXL TIE TypeScript TMG, compiler-compiler Tynker Tom U Ubercode Uniface UCSD Pascal UNITY Umple Unix shell Unicon UnrealScript V Vala Vim script Verilog Viper VHDL Visual DataFlex Visual DialogScript Visual LISP Visual FoxPro Visual Objects Visual J++ Visual Prolog W WATFIV, WATFOR Winbatch WebAssembly Wolfram Language WebDNA Wyvern Whiley X X++ XOTcl X10 Xod xBase XPL xBase++ XPL0 XBL XQuery XC (targets XMOS architecture) XSB xHarbour XSharp XL XSLT Xojo Xtend Y YAML Yoix Yorick YUI YQL Z Z notation Zig Zebra, ZPL, ZPL2 ZOPL Zeno ZPL ZetaLisp Z++.
Load more

Recommended publications
  • Modern Programming Languages CS508 Virtual University of Pakistan
    Modern Programming Languages (CS508) VU Modern Programming Languages CS508 Virtual University of Pakistan Leaders in Education Technology 1 © Copyright Virtual University of Pakistan Modern Programming Languages (CS508) VU TABLE of CONTENTS Course Objectives...........................................................................................................................4 Introduction and Historical Background (Lecture 1-8)..............................................................5 Language Evaluation Criterion.....................................................................................................6 Language Evaluation Criterion...................................................................................................15 An Introduction to SNOBOL (Lecture 9-12).............................................................................32 Ada Programming Language: An Introduction (Lecture 13-17).............................................45 LISP Programming Language: An Introduction (Lecture 18-21)...........................................63 PROLOG - Programming in Logic (Lecture 22-26) .................................................................77 Java Programming Language (Lecture 27-30)..........................................................................92 C# Programming Language (Lecture 31-34) ...........................................................................111 PHP – Personal Home Page PHP: Hypertext Preprocessor (Lecture 35-37)........................129 Modern Programming Languages-JavaScript
    [Show full text]
  • Language-Parametric Methods for Developing
    Gabriël Ditmar Primo Konat was born in The Language-Parametric Methods for Developing Interactive Programming Systems Language-Parametric Methods for Developing Interactive Programming Hague, the Netherlands. In 2009, he received his BSc in Computer Science from the Institute of Ap- Invitation plied Sciences in Rijswijk. In 2012, he received his MSc in Computer Science from Delft University of Technology (TUDelft). From 2012 to 2018, he was Language-Parametric a Ph.D. student with the Programming Languages Methods for Developing group at TUDelft, under supervision of Eelco Viss- Interactive Programming er and Sebastian Erdweg. His work focuses on lan- Systems guage workbenches and incremental build systems. Gabriël Konat [email protected] You are cordially invited to the public defense of my dissertation on Monday, November 18th, 2019 at 3pm. At 2:30pm, I will give a brief presentation summarizing my dissertation. The defense will take place in the Senaatszaal of the Delft University of Technology Auditorium, Mekelweg 5, 2628 CC Delft, the Netherlands Afterwards, there will be a Gabriël Konat Language-Parametric Methods for reception. Developing Interactive Programming Systems Gabriël Konat Propositions accompanying the dissertation Language-Parametric Methods for Developing Interactive Programming Systems by Gabriël Ditmar Primo Konat 1. Language-parametric methods for developing interactive programming sys- tems are feasible and useful. (This dissertation) 2. Compilers of general-purpose languages must be bootstrapped with fixpoint bootstrapping. (This dissertation) 3. Manually implementing an incremental system must be avoided. (This dissertation) 4. Like chemists need lab assistants, computer scientists need software engineers to support them in research, teaching, and application in industry. 5.
    [Show full text]
  • Examining the Hamilton C Shell
    EXAMINING ROO M Examining the Hamilton C Shell Unix power for OS/2 Scott Richman tarting OS/2 for the first time was, file system), long filenames, and threads. in the background and the server will for me, like unlocking a Ferarri, Additionally, the Shell supports large be kept busy. sitting behind its wheel and find­ command lines and pipes (up to 64K) ing a Yugo's dash. What a disap­ and includes faster and more powerful Supporting Procedures pointment. Sure, the engine and utilities than those supplied with OS/2. Script programmers can create C Shell suspensionS were first rate, but the con­ This is more than Unix - this is a pow­ procedures, which are more like func­ trols were minimal, the clutch was stiff, erful requirement for development un­ tions: They accept a parameter list and and the pedals were nonresponsive! der OS/2. The ability to execute C shells return a value. These procedures are OS/2 comes with great stuff, but CMD simultaneously in different Presenta­ compiled into C Shell memory and are .EXE, the default command-line pro­ tion Manager (PM) text windows con­ then executed as new shell commands. cessor, is poor compared to the pow­ verts your PC into a flexible workstation. Procedures can greatly extend the erfuloperating system beneath. CMD.EXE The Hamilton C Shell comes with power and flexibility of your environ­ appears to be a port of the MS-DOS many programs and shell scripts. To ment. COMMAND.COM and lacks the major install the Shell, you simply copy the As an example, consider ZCW.CSH features of a serious front end.
    [Show full text]
  • Unix and Linux System Administration and Shell Programming
    Unix and Linux System Administration and Shell Programming Unix and Linux System Administration and Shell Programming version 56 of August 12, 2014 Copyright © 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012, 2013, 2014 Milo This book includes material from the http://www.osdata.com/ website and the text book on computer programming. Distributed on the honor system. Print and read free for personal, non-profit, and/or educational purposes. If you like the book, you are encouraged to send a donation (U.S dollars) to Milo, PO Box 5237, Balboa Island, California, USA 92662. This is a work in progress. For the most up to date version, visit the website http://www.osdata.com/ and http://www.osdata.com/programming/shell/unixbook.pdf — Please add links from your website or Facebook page. Professors and Teachers: Feel free to take a copy of this PDF and make it available to your class (possibly through your academic website). This way everyone in your class will have the same copy (with the same page numbers) despite my continual updates. Please try to avoid posting it to the public internet (to avoid old copies confusing things) and take it down when the class ends. You can post the same or a newer version for each succeeding class. Please remove old copies after the class ends to prevent confusing the search engines. You can contact me with a specific version number and class end date and I will put it on my website. version 56 page 1 Unix and Linux System Administration and Shell Programming Unix and Linux Administration and Shell Programming chapter 0 This book looks at Unix (and Linux) shell programming and system administration.
    [Show full text]
  • Stan-(X-249-71 December 1971
    S U326 P23-17 AN ANNOTATED BIBLIOGRAPHY ON THE CONSTRUCTION OF COMPILERS . BY BARY W. POLLACK STAN-(X-249-71 DECEMBER 1971 - COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UNIVERS II-Y An Annotated Bibliography on the Construction of Compilers* 1971 Bary W. Pollack Computer Science Department Stanford University This bibliography is divided into 9 sections: 1. General Information on Compiling Techniques 2. Syntax- and Base-Directed Parsing c 30 Brsing in General 4. Resource Allocation 59 Errors - Detection and Correction 6. Compiler Implementation in General - 79 Details of Compiler Construction 8. Additional Topics 9* Miscellaneous Related References Within each section the entries are alphabetical by author. Keywords describing the entry will be found for each entry set off by pound signs (*#). Some amount of cross-referencing has been done; e.g., entries which fall into Section 3 as well as Section 7 will generally be found in both sections. However, entries will be found listed only under the principle or first author's name. Computing Review citations are given following the annotation when available. "this research was supported by the Atomic Energy Commission, Project ~~-326~23. Available from the Clearinghouse for Federal Scientific and Technical Information, Springfield, Virginia 22151. 0 l/03/72 16:44:58 COMPILER CONSTRUCTION TECHNIQUES PACFl 1, 1 ANNOTATED RTBLIOGRAPHY GENERAL INFORMATION ON COMP?LING TECHNIQOES Abrahams, P, W. Symbol manipulation languages. Advances in Computers, Vol 9 (196R), Sl-111, Academic Press, N. Y. ? languages Ic Anonymous. Philosophies for efficient processor construction. ICC Dull, I, 2 (July W62), 85-89. t processors t CR 4536.
    [Show full text]
  • Curriculum Vitae of Nicole Ashley Hamilton
    Nicole Hamilton Computer Science and Engineering University of Michigan 2649 Beyster 2260 Hayward Street Ann Arbor, MI 48109-2121 [email protected] https://web.eecs.umich.edu/~nham/ Summary Lecturer in computer science and engineering at University of Michigan. Previously, lecturer in electrical engineering at University of Washington Bothell. Founder of Hamilton Laboratories and author of Hamilton C shell, a software tools package for developers on Windows. Wrote the query language and ranker for the first release of Microsoft’s Bing search engine. Expertise in digital design, Verilog, C, C++, embedded systems, processors, device drivers, compilers, circuits, transistors, search engines, OS concepts, algorithms, heuristics, Linux, program management, intellectual property, licensing. Education MBA valedictorian, High Honors, Boston University, May 1987. BS and MS, Electrical Engineering, Stanford University, June 1973. Experience Sep 2017 to Present Lecturer III, Computer Science and Engineering University of Michigan, Ann Arbor Instructor for EECS 280, C++ and Object-Oriented Programming, and EECS 398, System Design in C++, a course I created where students work in teams of five or six to build a whole search engine from scratch. Also serve on our program committee and as an undergraduate advisor. Jun 2013 to Jun 2017 Lecturer, Electrical Engineering University of Washington Bothell Instructor for BEE 271, Digital Design with Verilog, BEE/CSS 371 Business of Technology, a course on entrepreneurship, and the labs for BEE 233 Circuits, BEE 332 Transistors and BEE 425 Microprocessors. Adviser to numerous teams on their senior Capstone projects. Past teams have built a diagnostic tool for large trucks (PACCAR), a pulse width modulated motor controller using a PIC 18F4550, a DSP for an ECG using a Zynq-7000 (both Phillips) and an SDRAM controller in Verilog for the open source mips32r1 soft processor (IEEE Nexus).
    [Show full text]
  • Docworks PDF 600
    Minimax estimation in regression and random censorship models Citation for published version (APA): Belitser, E. N. (2000). Minimax estimation in regression and random censorship models. (CWI tracts; Vol. 127). Centrum voor Wiskunde en Informatica. Document status and date: Published: 01/01/2000 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication 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.
    [Show full text]
  • Dcap106 Operating Syste
    1 ** 23# Edited by: Dr. Avinash Bhagat www.lpude.in DIRECTORATE OF DISTANCE EDUCATION OPERATING SYSTEM TOOLS Edited By Dr. Avinash Bhagat Printed by EXCEL BOOKS PRIVATE LIMITED A-45, Naraina, Phase-I, New Delhi-110028 for Lovely Professional University Phagwara SYLLABUS Operating System Tools Objectives: To enable the student to understand technicalities of Linux including installation, troubleshooting, shell programming, file system, managing servers and internet communication. Sr. No. Topics 1. Installing Linux: Preparing for the installation, The installation, Root account configuration. 2. Red Hat Linux 9 Basics: Moving around the desktop, Using applications, The file system, hierarchy, Navigating in the file system, Managing Hardware, Configuring the desktop, Managing processes, Managing Users. 3. Connecting to the Internet: Connecting to the Internet, Managing Multiple ISPs and connections, Software and configuration. 4. Installing Software: RPM, its benefits, The RPM command line tool. 5. Everyday Applications: Office applications, Internet applications, Personal information management. 6. Everyday Applications: Multimedia applications, System applications. 7. The Shell: The Shell as a command line interface, types of shell, Built-in programs and external programs. 8. The Shell: Common Shell commands , Special keys and shortcuts, Command line syntax. 9. The File System: The File System, anatomy of a file, File Search Utilities, locate command, find command, GNOME, Navigating file system . 10. Servers: Introduction to DNS, FTP,
    [Show full text]
  • Writing Cybersecurity Job Descriptions for the Greatest Impact
    Writing Cybersecurity Job Descriptions for the Greatest Impact Keith T. Hall U.S. Department of Homeland Security Welcome Writing Cybersecurity Job Descriptions for the Greatest Impact Disclaimers and Caveats • Content Not Officially Adopted. The content of this briefing is mine personally and does not reflect any position or policy of the United States Government (USG) or of the Department of Homeland Security. • Note on Terminology. Will use USG terminology in this brief (but generally translatable towards Private Sector equivalents) • Job Description Usage. For the purposes of this presentation only, the Job Description for the Position Description (PD) is used synonymously with the Job Opportunity Announcement (JOA). Although there are potential differences, it is not material to the concepts presented today. 3 Key Definitions and Concepts (1 of 2) • What do you want the person to do? • Major Duties and Responsibilities. “A statement of the important, regular, and recurring duties and responsibilities assigned to the position” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/classifierhandbook.pdf • Major vs. Minor Duties. “Major duties are those that represent the primary reason for the position's existence, and which govern the qualification requirements. Typically, they occupy most of the employee's time. Minor duties generally occupy a small portion of time, are not the primary purpose for which the position was established, and do not determine qualification requirements” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/positionclassificationintro.pdf • Tasks. “Activities an employee performs on a regular basis in order to carry out the functions of the job.” SOURCE: https://www.opm.gov/policy-data-oversight/assessment-and-selection/job-analysis/job_analysis_presentation.pdf 4 Key Definitions and Concepts (2 of 2) • What do you want to see on resumes that qualifies them to do this work? • Competency.
    [Show full text]
  • Comparative Programming Languages CM20253
    We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily
    [Show full text]
  • Introducción a Consola
    Introducci´ona consola Introducci´ona consola \La consola es tu amiga" Diego Fanego y Patricio Morenoy Rodrigo Ubal Dahlyz Cynthia Gamarrayz yFacultad de Ingenier´ıa(UBA) zLABI 27 de abril de 2017 Fanego, Moreno, Ubal Dahl, Gamarra Facultad de Ingenier´ıa(UBA), LABI Introducci´ona consola Introducci´ona consola LABi >Qu´ese puede hacer en el labi? Estudiar Hacer TPs Pedir herramientas Usar herramientas del pa~nol Pedir libros de la biblioteca especializada Tomar mate/comer Dejando siempre las mesas limpias :) Fanego, Moreno, Ubal Dahl, Gamarra Facultad de Ingenier´ıa(UBA), LABI Introducci´ona consola Introducci´ona consola Cursos del LABi Soldadura (Intro, t´ecnicadigital, labo de micros, circuitos) Software libre: LATEX(Todas las materias donde haya que presentar informes, papers, tesis) Octave (An´alisisde circuitos, procesos estoc´asticos,se~nales, redes neuronales) KiCad (Labo de micros, circuitos) Introducci´ona la consola OpenSCAD Software gratuito: LTSpice (An´alisisde circuitos, circuitos) Y otros... Fanego, Moreno, Ubal Dahl, Gamarra Facultad de Ingenier´ıa(UBA), LABI Introducci´ona consola Introducci´ona consola Fanego, Moreno, Ubal Dahl, Gamarra Facultad de Ingenier´ıa(UBA), LABI Introducci´ona consola Introducci´ona consola Tabla de Contenidos Fanego, Moreno, Ubal Dahl, Gamarra Facultad de Ingenier´ıa(UBA), LABI Introducci´ona consola Crear directorios Buscar archivos Procesar informaci´on Entender un poco m´as nuestro sistema de archivos Introducci´ona consola Introducci´on Objetivo Navegar el sistema de archivos Fanego, Moreno,
    [Show full text]
  • Compiler Construction
    Compiler construction PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 10 Dec 2011 02:23:02 UTC Contents Articles Introduction 1 Compiler construction 1 Compiler 2 Interpreter 10 History of compiler writing 14 Lexical analysis 22 Lexical analysis 22 Regular expression 26 Regular expression examples 37 Finite-state machine 41 Preprocessor 51 Syntactic analysis 54 Parsing 54 Lookahead 58 Symbol table 61 Abstract syntax 63 Abstract syntax tree 64 Context-free grammar 65 Terminal and nonterminal symbols 77 Left recursion 79 Backus–Naur Form 83 Extended Backus–Naur Form 86 TBNF 91 Top-down parsing 91 Recursive descent parser 93 Tail recursive parser 98 Parsing expression grammar 100 LL parser 106 LR parser 114 Parsing table 123 Simple LR parser 125 Canonical LR parser 127 GLR parser 129 LALR parser 130 Recursive ascent parser 133 Parser combinator 140 Bottom-up parsing 143 Chomsky normal form 148 CYK algorithm 150 Simple precedence grammar 153 Simple precedence parser 154 Operator-precedence grammar 156 Operator-precedence parser 159 Shunting-yard algorithm 163 Chart parser 173 Earley parser 174 The lexer hack 178 Scannerless parsing 180 Semantic analysis 182 Attribute grammar 182 L-attributed grammar 184 LR-attributed grammar 185 S-attributed grammar 185 ECLR-attributed grammar 186 Intermediate language 186 Control flow graph 188 Basic block 190 Call graph 192 Data-flow analysis 195 Use-define chain 201 Live variable analysis 204 Reaching definition 206 Three address
    [Show full text]