|
Meta-II
META II is a domain-specific programming language for writing compilers. It was created in 1963–1964 by Dewey Val Schorre at University of California, Los Angeles (UCLA). META II uses what Schorre called ''syntax equations''. Its operation is simply explained as: Each ''syntax equation'' is translated into a recursive subroutine which tests the input string for a particular phrase structure, and deletes it if found. Meta II programs are compiled into an interpreted byte code language. VALGOL and SMALGOL compilers illustrating its capabilities were written in the META II language, VALGOL is a simple algebraic language designed for the purpose of illustrating META II. SMALGOL was a fairly large subset of ALGOL 60. Notation META II was first written in META I, a hand-compiled version of META II. The history is unclear as to whether META I was a full implementation of META II or a required subset of the META II language required to compile the full META II compiler. In its d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Backus–Naur Form
In computer science, Backus–Naur form (BNF, pronounced ), also known as Backus normal form, is a notation system for defining the Syntax (programming languages), syntax of Programming language, programming languages and other Formal language, formal languages, developed by John Backus and Peter Naur. It is a metasyntax for Context-free grammar, context-free grammars, providing a precise way to outline the rules of a language's structure. It has been widely used in official specifications, manuals, and textbooks on programming language theory, as well as to describe Document format, document formats, Instruction set, instruction sets, and Communication protocol, communication protocols. Over time, variations such as extended Backus–Naur form (EBNF) and augmented Backus–Naur form (ABNF) have emerged, building on the original framework with added features. Structure BNF specifications outline how symbols are combined to form syntactically valid sequences. Each BNF consists of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domain-specific Language
A domain-specific language (DSL) is a computer language specialized to a particular application domain. This is in contrast to a general-purpose language (GPL), which is broadly applicable across domains. There are a wide variety of DSLs, ranging from widely used languages for common domains, such as HTML for web pages, down to languages used by only one or a few pieces of software, such as MUSH soft code. DSLs can be further subdivided by the kind of language, and include domain-specific ''markup'' languages, domain-specific ''modeling'' languages (more generally, specification languages), and domain-specific ''programming'' languages. Special-purpose computer languages have always existed in the computer age, but the term "domain-specific language" has become more popular due to the rise of domain-specific modeling. Simpler DSLs, particularly ones used by a single application, are sometimes informally called mini-languages. The line between general-purpose languages and doma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stack-oriented Programming
Stack-oriented programming is a programming paradigm that relies on one or more stack machine, stacks to manipulate data and/or pass parameters. Programming constructs in other programming languages need to be modified for use in a stack-oriented system. Most stack-oriented languages operate in ''postfix'' or Reverse Polish notation: arguments or parameters for a command are listed before that command. For example, postfix notation would be written instead of (''prefix'' or Polish notation), or (infix notation, ''infix'' notation). The programming languages Forth (programming language), Forth, Factor (programming language), Factor, RPL (programming language), RPL, PostScript, BibTeX style design language and many assembly languages fit this paradigm. Stack-based algorithms manipulate data by popping data from and pushing data to the stack. Operators govern how the stack manipulates data. To emphasize the effect of a statement, a comment is often used showing the top of the sta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
LISP 2
LISP 2 is a programming language proposed in the 1960s as the successor to Lisp. It had largely Lisp-like semantics and ALGOL 60-like syntax. It is remembered mostly for its syntax, yet it had many features beyond those of early Lisps. Early Lisps had many limits, including limited data types and slow numerics. Its use of fully parenthesized notation was also considered a problem. The inventor of Lisp, John McCarthy, expected these issues to be addressed in a later version, called notionally Lisp 2. Hence the name Lisp 1.5 for the successor to the earliest Lisp.McCarthy, 1979 Lisp 2 was a joint project of the System Development Corporation and Information International, Inc., and was intended for the IBM built AN/FSQ-32 military computer. Development later shifted to the IBM 360/67 and the Digital Equipment Corporation PDP-6 The PDP-6, short for Programmed Data Processor model 6, is a computer developed by Digital Equipment Corporation (DEC) during 1963 and first delivere ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
System Development Corporation
System Development Corporation (SDC) was a computer software company based in Santa Monica, California. Initially created as a division of the RAND Corporation in December 1955 (under the name System Development Division) and established as an independent organization in October 1956, it was a very influential organization that trained a large portion of the emerging programmer workforce in the United States in the late 1950s, referred to by some as "a university for programmers." History SDC began as the systems engineering group for the SAGE air-defense system at the RAND Corporation. In April 1955, the government contracted with RAND to help write software for the SAGE project. Within a few months, RAND's System Development Division had 500 employees developing SAGE applications. Within a year, the division had up to 1,000 employees. RAND spun off the group in 1956 as a non-profit organization that provided expertise for the United States military in the design, integration, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Users' Group
A users' group (also user's group or user group) is a type of club focused on the use of a particular technology, usually (but not always) computer-related. Overview Users' groups started in the early days of mainframe computers, as a way to share sometimes hard-won knowledge and useful software, usually written by end users independently of the vendor-supplied programming efforts. SHARE, a user group originated by aerospace industry corporate users of IBM mainframe computers, was founded in 1955 and is the oldest computer user group still active. DECUS, the DEC User's Society, was founded in 1961 and its descendant organization, Connect Worldwide, still operates. The Computer Measurement Group (CMG) was founded in 1974 by systems professionals with a common interest in (mainframe) capacity management, and continues today with a much broader mission. The first UNIX users' group organized in 1978. Users' groups began to proliferate with the microcomputer revolution of the la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CP/M
CP/M, originally standing for Control Program/Monitor and later Control Program for Microcomputers, is a mass-market operating system created in 1974 for Intel 8080/Intel 8085, 85-based microcomputers by Gary Kildall of Digital Research, Digital Research, Inc. CP/M is a disk operating system and its purpose is to organize files on a magnetic storage medium, and to load and run programs stored on a disk. Initially confined to single-tasking on 8-bit processors and no more than 64 kilobytes of memory, later versions of CP/M added multi-user variations and were migrated to 16-bit processors. CP/M's core components are the ''Basic Input/Output System'' (BIOS), the ''Basic Disk Operating System'' (BDOS), and the ''Console Command Processor'' (CCP). The BIOS consists of drivers that deal with devices and system hardware. The BDOS implements the file system and provides system services to applications. The CCP is the command-line interpreter and provides some built-in commands. CP ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alan Kay
Alan Curtis Kay (born May 17, 1940) published by the Association for Computing Machinery 2012 is an American computer scientist who pioneered work on object-oriented programming and windowing graphical user interface (GUI) design. At Xerox PARC he led the design and development of the first modern windowed computer desktop interface. There he also led the development of the influential object-oriented programming language Smalltalk, both personally designing most of the early versions of the language and coining the term "object-oriented." He has been elected a Fellow of the American Academy of Arts and Sciences, the National Academy of Engineering, and the Royal Society of Arts. He received the Turing Award in 2003. Early life and work In an interview on education in America with the Davis Group Ltd., Kay said: Originally from Springfield, Massachusetts, Kay's family relocated several times due to his father's career in physiology before ultimately settling in the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bootstrapping
In general, bootstrapping usually refers to a self-starting process that is supposed to continue or grow without external input. Many analytical techniques are often called bootstrap methods in reference to their self-starting or self-supporting implementation, such as bootstrapping (statistics), bootstrapping (finance), or bootstrapping (linguistics). Etymology Tall boots may have a tab, loop or handle at the top known as a bootstrap, allowing one to use fingers or a boot hook tool to help pull the boots on. The saying "to " was already in use during the 19th century as an example of an impossible task. The idiom dates at least to 1834, when it appeared in the ''Workingman's Advocate'': "It is conjectured that Mr. Murphee will now be enabled to hand himself over the Cumberland river or a barn yard fence by the straps of his boots."Jan FreemanBootstraps and Baron Munchausen '' Boston.com'', January 27, 2009 In 1860 it appeared in a comment about philosophy of mind: "The a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Virtual Machine
In computing, a virtual machine (VM) is the virtualization or emulator, emulation of a computer system. Virtual machines are based on computer architectures and provide the functionality of a physical computer. Their implementations may involve specialized hardware, software, or a combination of the two. Virtual machines differ and are organized by their function, shown here: * ''System virtual machines'' (also called full virtualization VMs, or SysVMs) provide a substitute for a real machine. They provide the functionality needed to execute entire operating systems. A hypervisor uses native code, native execution to share and manage hardware, allowing for multiple environments that are isolated from one another yet exist on the same physical machine. Modern hypervisors use hardware-assisted virtualization, with virtualization-specific hardware features on the host CPUs providing assistance to hypervisors. * ''Process virtual machines'' are designed to execute computer programs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metacompiler
In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine. The most common type of compiler-compiler is called a parser generator. It handles only syntactic analysis. A formal description of a language is usually a grammar used as an input to a parser generator. It often resembles Backus–Naur form (BNF), extended Backus–Naur form (EBNF), or has its own syntax. Grammar files describe a syntax of a generated compiler's target programming language and actions that should be taken against its specific constructs. Source code for a parser of the programming language is returned as the parser generator's output. This source code can then be compiled into a parser, which may be either standalone or embedded. The compiled parser then accepts the source code of the target programming language as an input and performs an action or ou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reverse Polish Notation
Reverse Polish notation (RPN), also known as reverse Łukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators ''follow'' their operands, in contrast to prefix or Polish notation (PN), in which operators ''precede'' their operands. The notation does not need any parentheses for as long as each operator has a fixed number of operands. The term ''postfix notation'' describes the general scheme in mathematics and computer sciences, whereas the term ''reverse Polish notation'' typically refers specifically to the method used to enter calculations into hardware or software calculators, which often have additional side effects and implications depending on the actual implementation involving a stack. The description "Polish" refers to the nationality of logician Jan Łukasiewicz, who invented Polish notation in 1924. The first computer to use postfix notation, though it long remained essentially unknown outside of G ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
