102 relations: Abstract syntax, Ada (programming language), Address (geography), Alan Turing, Algebraic data type, ALGOL, ALGOL 58, ALGOL 60, ALGOL 68, Alternation (formal language theory), ANTLR, Apache Subversion, Apartment, ASCII, Association for Computing Machinery, Augmented Backus–Naur form, Australia, Axel Thue, Boolean algebra, Canonical normal form, Chomsky normal form, COBOL, Coco/R, Common Era, Communication protocol, Compiler Description Language, Compiler-compiler, Computer science, Context-free grammar, Definite clause grammar, DMS Software Reengineering Toolkit, Document file format, Donald Knuth, Emil Leon Post, Empty string, Expression (mathematics), Extended Backus–Naur form, Formal grammar, Generative grammar, Germany, Given name, GNU bison, GOLD (parser), Haskell (programming language), IBM, Information theory, Initial, Instruction set architecture, Internet Engineering Task Force, ISO 10303, ..., Java (programming language), John Backus, Leonard Bloomfield, Linguistics, List of STEP (ISO 10303) parts, List of U.S. state abbreviations, Massachusetts Institute of Technology, Mathematical logic, META II, Metalanguage, Metasyntax, Natural language, Newline, Noam Chomsky, Normal form (abstract rewriting), Norway, Operating system, Parsing expression grammar, Pascal (programming language), Pāṇini, Peter Naur, PL/I, Programming language, Recursion (computer science), Regular expression, Roman numerals, Sanskrit, Saul Rosen, SHARE (computing), SQL, Street or road name, Suffix (name), Surname, Sweden, Switzerland, Symbol, Syntactic Structures, Syntax (programming languages), Syntax diagram, Terminal and nonterminal symbols, Town, Translational Backus–Naur form, TREE-META, United Kingdom, Van Wijngaarden grammar, Vertical bar, Whitespace character, Wirth syntax notation, XPL, Yacc, Zellig Harris, ZIP Code. Expand index (52 more) »
Abstract syntax
In computer science, the abstract syntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent of any particular representation or encoding.
New!!: Backus–Naur form and Abstract syntax · See more »
Ada (programming language)
Ada is a structured, statically typed, imperative, and object-oriented high-level computer programming language, extended from Pascal and other languages.
New!!: Backus–Naur form and Ada (programming language) · See more »
Address (geography)
An address is a collection of information, presented in a mostly fixed format, used to give the location of a building, apartment, or other structure or a plot of land, generally using political boundaries and street names as references, along with other identifiers such as house or apartment numbers.
New!!: Backus–Naur form and Address (geography) · See more »
Alan Turing
Alan Mathison Turing (23 June 1912 – 7 June 1954) was an English computer scientist, mathematician, logician, cryptanalyst, philosopher, and theoretical biologist.
New!!: Backus–Naur form and Alan Turing · See more »
Algebraic data type
In computer programming, especially functional programming and type theory, an algebraic data type is a kind of composite type, i.e., a type formed by combining other types.
New!!: Backus–Naur form and Algebraic data type · See more »
ALGOL
ALGOL (short for "Algorithmic Language") is a family of imperative computer programming languages, originally developed in the mid-1950s, which greatly influenced many other languages and was the standard method for algorithm description used by the ACM in textbooks and academic sources for more than thirty years.
New!!: Backus–Naur form and ALGOL · See more »
ALGOL 58
ALGOL 58, originally known as IAL, is one of the family of ALGOL computer programming languages.
New!!: Backus–Naur form and ALGOL 58 · See more »
ALGOL 60
ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages.
New!!: Backus–Naur form and ALGOL 60 · See more »
ALGOL 68
ALGOL 68 (short for Algorithmic Language 1968) is an imperative computer programming language that was conceived as a successor to the ALGOL 60 programming language, designed with the goal of a much wider scope of application and more rigorously defined syntax and semantics.
New!!: Backus–Naur form and ALGOL 68 · See more »
Alternation (formal language theory)
In formal language theory and pattern matching, alternation is the union of two sets of strings or patterns.
New!!: Backus–Naur form and Alternation (formal language theory) · See more »
ANTLR
In computer-based language recognition, ANTLR (pronounced Antler), or Another Tool For Language Recognition, is a parser generator that uses LL(*) for parsing.
New!!: Backus–Naur form and ANTLR · See more »
Apache Subversion
Apache Subversion (often abbreviated SVN, after its command name svn) is a software versioning and revision control system distributed as open source under the Apache License.
New!!: Backus–Naur form and Apache Subversion · See more »
Apartment
An apartment (American English), flat (British English) or unit (Australian English) is a self-contained housing unit (a type of residential real estate) that occupies only part of a building, generally on a single storey.
New!!: Backus–Naur form and Apartment · See more »
ASCII
ASCII, abbreviated from American Standard Code for Information Interchange, is a character encoding standard for electronic communication.
New!!: Backus–Naur form and ASCII · See more »
Association for Computing Machinery
The Association for Computing Machinery (ACM) is an international learned society for computing.
New!!: Backus–Naur form and Association for Computing Machinery · See more »
Augmented Backus–Naur form
In computer science, augmented Backus–Naur form (ABNF) is a metalanguage based on Backus–Naur form (BNF), but consisting of its own syntax and derivation rules.
New!!: Backus–Naur form and Augmented Backus–Naur form · See more »
Australia
Australia, officially the Commonwealth of Australia, is a sovereign country comprising the mainland of the Australian continent, the island of Tasmania and numerous smaller islands.
New!!: Backus–Naur form and Australia · See more »
Axel Thue
Axel Thue (19 February 1863 – 7 March 1922), was a Norwegian mathematician, known for highly original work in diophantine approximation, and combinatorics.
New!!: Backus–Naur form and Axel Thue · See more »
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively.
New!!: Backus–Naur form and Boolean algebra · See more »
Canonical normal form
In Boolean algebra, any Boolean function can be put into the canonical disjunctive normal form (CDNF) or minterm canonical form and its dual canonical conjunctive normal form (CCNF) or maxterm canonical form.
New!!: Backus–Naur form and Canonical normal form · See more »
Chomsky normal form
In formal language theory, a context-free grammar G is said to be in Chomsky normal form (first described by Noam Chomsky) if all of its production rules are of the form: where A, B, and C are nonterminal symbols, a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string.
New!!: Backus–Naur form and Chomsky normal form · See more »
COBOL
COBOL (an acronym for "common business-oriented language") is a compiled English-like computer programming language designed for business use.
New!!: Backus–Naur form and COBOL · See more »
Coco/R
Coco/R is a compiler generator that takes an L-attributed Extended Backus–Naur Form (EBNF) grammar of a source language and generates a scanner and a parser for that language.
New!!: Backus–Naur form and Coco/R · See more »
Common Era
Common Era or Current Era (CE) is one of the notation systems for the world's most widely used calendar era – an alternative to the Dionysian AD and BC system.
New!!: Backus–Naur form and Common Era · See more »
Communication protocol
In telecommunication, a communication protocol is a system of rules that allow two or more entities of a communications system to transmit information via any kind of variation of a physical quantity.
New!!: Backus–Naur form and Communication protocol · See more »
Compiler Description Language
Compiler Description Language, or CDL, is a programming language based on affix grammars.
New!!: Backus–Naur form and Compiler Description Language · See more »
Compiler-compiler
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 language and machine.
New!!: Backus–Naur form and Compiler-compiler · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Backus–Naur form and Computer science · See more »
Context-free grammar
In formal language theory, a context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language.
New!!: Backus–Naur form and Context-free grammar · See more »
Definite clause grammar
A definite clause grammar (DCG) is a way of expressing grammar, either for natural or formal languages, in a logic programming language such as Prolog.
New!!: Backus–Naur form and Definite clause grammar · See more »
DMS Software Reengineering Toolkit
The DMS Software Reengineering Toolkit is a proprietary set of program transformation tools available for automating custom source program analysis, modification, translation or generation of software systems for arbitrary mixtures of source languages for large scale software systems.
New!!: Backus–Naur form and DMS Software Reengineering Toolkit · See more »
Document file format
A document file format is a text or binary file format for storing documents on a storage media, especially for use by computers.
New!!: Backus–Naur form and Document file format · See more »
Donald Knuth
Donald Ervin Knuth (born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University.
New!!: Backus–Naur form and Donald Knuth · See more »
Emil Leon Post
Emil Leon Post (February 11, 1897 – April 21, 1954) was an American mathematician and logician.
New!!: Backus–Naur form and Emil Leon Post · See more »
Empty string
In formal language theory, the empty string, or empty word is the unique string of length zero.
New!!: Backus–Naur form and Empty string · See more »
Expression (mathematics)
In mathematics, an expression or mathematical expression is a finite combination of symbols that is well-formed according to rules that depend on the context.
New!!: Backus–Naur form and Expression (mathematics) · See more »
Extended Backus–Naur form
In computer science, extended Backus-Naur form (EBNF) is a family of metasyntax notations, any of which can be used to express a context-free grammar.
New!!: Backus–Naur form and Extended Backus–Naur form · See more »
Formal grammar
In formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) is a set of production rules for strings in a formal language.
New!!: Backus–Naur form and Formal grammar · See more »
Generative grammar
Generative grammar is a linguistic theory that regards grammar as a system of rules that generates exactly those combinations of words that form grammatical sentences in a given language.
New!!: Backus–Naur form and Generative grammar · See more »
Germany
Germany (Deutschland), officially the Federal Republic of Germany (Bundesrepublik Deutschland), is a sovereign state in central-western Europe.
New!!: Backus–Naur form and Germany · See more »
Given name
A given name (also known as a first name, forename or Christian name) is a part of a person's personal name.
New!!: Backus–Naur form and Given name · See more »
GNU bison
GNU bison, commonly known as Bison, is a parser generator that is part of the GNU Project.
New!!: Backus–Naur form and GNU bison · See more »
GOLD (parser)
GOLD is a free parsing system that is designed to support multiple programming languages.
New!!: Backus–Naur form and GOLD (parser) · See more »
Haskell (programming language)
Haskell is a standardized, general-purpose compiled purely functional programming language, with non-strict semantics and strong static typing.
New!!: Backus–Naur form and Haskell (programming language) · See more »
IBM
The International Business Machines Corporation (IBM) is an American multinational technology company headquartered in Armonk, New York, United States, with operations in over 170 countries.
New!!: Backus–Naur form and IBM · See more »
Information theory
Information theory studies the quantification, storage, and communication of information.
New!!: Backus–Naur form and Information theory · See more »
Initial
In a written or published work, an initial or drop cap is a letter at the beginning of a word, a chapter, or a paragraph that is larger than the rest of the text.
New!!: Backus–Naur form and Initial · See more »
Instruction set architecture
An instruction set architecture (ISA) is an abstract model of a computer.
New!!: Backus–Naur form and Instruction set architecture · See more »
Internet Engineering Task Force
The Internet Engineering Task Force (IETF) develops and promotes voluntary Internet standards, in particular the standards that comprise the Internet protocol suite (TCP/IP).
New!!: Backus–Naur form and Internet Engineering Task Force · See more »
ISO 10303
ISO 10303 is an ISO standard for the computer-interpretable representation and exchange of product manufacturing information.
New!!: Backus–Naur form and ISO 10303 · See more »
Java (programming language)
Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.
New!!: Backus–Naur form and Java (programming language) · See more »
John Backus
John Warner Backus (December 3, 1924 – March 17, 2007) was an American computer scientist.
New!!: Backus–Naur form and John Backus · See more »
Leonard Bloomfield
Leonard Bloomfield (April 1, 1887 – April 18, 1949) was an American linguist who led the development of structural linguistics in the United States during the 1930s and the 1940s.
New!!: Backus–Naur form and Leonard Bloomfield · See more »
Linguistics
Linguistics is the scientific study of language, and involves an analysis of language form, language meaning, and language in context.
New!!: Backus–Naur form and Linguistics · See more »
List of STEP (ISO 10303) parts
An incomplete list of parts making up STEP (ISO 10303).
New!!: Backus–Naur form and List of STEP (ISO 10303) parts · See more »
List of U.S. state abbreviations
Several sets of codes and abbreviations are used to represent the political divisions of the United States for postal addresses, data processing, general abbreviations, and other purposes.
New!!: Backus–Naur form and List of U.S. state abbreviations · See more »
Massachusetts Institute of Technology
The Massachusetts Institute of Technology (MIT) is a private research university located in Cambridge, Massachusetts, United States.
New!!: Backus–Naur form and Massachusetts Institute of Technology · See more »
Mathematical logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
New!!: Backus–Naur form and Mathematical logic · See more »
META II
META II is a domain-specific programming language for writing compilers.
New!!: Backus–Naur form and META II · See more »
Metalanguage
Broadly, any metalanguage is language or symbols used when language itself is being discussed or examined.
New!!: Backus–Naur form and Metalanguage · See more »
Metasyntax
A metasyntax describes the allowable structure and composition of phrases and sentences of a metalanguage, which is used to describe either a natural language or a computer programming language.
New!!: Backus–Naur form and Metasyntax · See more »
Natural language
In neuropsychology, linguistics, and the philosophy of language, a natural language or ordinary language is any language that has evolved naturally in humans through use and repetition without conscious planning or premeditation.
New!!: Backus–Naur form and Natural language · See more »
Newline
Newline (frequently called line ending, end of line (EOL), line feed, or line break) is a control character or sequence of control characters in a character encoding specification, e.g. ASCII or EBCDIC.
New!!: Backus–Naur form and Newline · See more »
Noam Chomsky
Avram Noam Chomsky (born December 7, 1928) is an American linguist, philosopher, cognitive scientist, historian, social critic and political activist.
New!!: Backus–Naur form and Noam Chomsky · See more »
Normal form (abstract rewriting)
In abstract rewriting, an object is in normal form if it cannot be rewritten any further.
New!!: Backus–Naur form and Normal form (abstract rewriting) · See more »
Norway
Norway (Norwegian: (Bokmål) or (Nynorsk); Norga), officially the Kingdom of Norway, is a unitary sovereign state whose territory comprises the western portion of the Scandinavian Peninsula plus the remote island of Jan Mayen and the archipelago of Svalbard.
New!!: Backus–Naur form and Norway · See more »
Operating system
An operating system (OS) is system software that manages computer hardware and software resources and provides common services for computer programs.
New!!: Backus–Naur form and Operating system · See more »
Parsing expression grammar
In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language.
New!!: Backus–Naur form and Parsing expression grammar · See more »
Pascal (programming language)
Pascal is an imperative and procedural programming language, which Niklaus Wirth designed in 1968–69 and published in 1970, as a small, efficient language intended to encourage good programming practices using structured programming and data structuring. It is named in honor of the French mathematician, philosopher and physicist Blaise Pascal. Pascal was developed on the pattern of the ALGOL 60 language. Wirth had already developed several improvements to this language as part of the ALGOL X proposals, but these were not accepted and Pascal was developed separately and released in 1970. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985; this was used by Apple Computer and Borland in the late 1980s and later developed into Delphi on the Microsoft Windows platform. Extensions to the Pascal concepts led to the Pascal-like languages Modula-2 and Oberon.
New!!: Backus–Naur form and Pascal (programming language) · See more »
Pāṇini
(पाणिनि, Frits Staal (1965),, Philosophy East and West, Vol. 15, No. 2 (Apr., 1965), pp. 99-116) is an ancient Sanskrit philologist, grammarian, and a revered scholar in Hinduism.
New!!: Backus–Naur form and Pāṇini · See more »
Peter Naur
Peter Naur (25 October 1928 – 3 January 2016) was a Danish computer science pioneer and Turing award winner.
New!!: Backus–Naur form and Peter Naur · See more »
PL/I
PL/I (Programming Language One, pronounced) is a procedural, imperative computer programming language designed for scientific, engineering, business and system programming uses.
New!!: Backus–Naur form and PL/I · See more »
Programming language
A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.
New!!: Backus–Naur form and Programming language · See more »
Recursion (computer science)
Recursion in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem (as opposed to iteration).
New!!: Backus–Naur form and Recursion (computer science) · See more »
Regular expression
A regular expression, regex or regexp (sometimes called a rational expression) is, in theoretical computer science and formal language theory, a sequence of characters that define a search pattern.
New!!: Backus–Naur form and Regular expression · See more »
Roman numerals
The numeric system represented by Roman numerals originated in ancient Rome and remained the usual way of writing numbers throughout Europe well into the Late Middle Ages.
New!!: Backus–Naur form and Roman numerals · See more »
Sanskrit
Sanskrit is the primary liturgical language of Hinduism; a philosophical language of Hinduism, Sikhism, Buddhism and Jainism; and a former literary language and lingua franca for the educated of ancient and medieval India.
New!!: Backus–Naur form and Sanskrit · See more »
Saul Rosen
Saul Rosen (February 8, 1922 – June 9, 1991) was an American computer science pioneer.
New!!: Backus–Naur form and Saul Rosen · See more »
SHARE (computing)
SHARE Inc. is a volunteer-run user group for IBM mainframe computers that was founded in 1955 by Los Angeles-area users of the IBM 701 computer system.
New!!: Backus–Naur form and SHARE (computing) · See more »
SQL
SQL (S-Q-L, "sequel"; Structured Query Language) is a domain-specific language used in programming and designed for managing data held in a relational database management system (RDBMS), or for stream processing in a relational data stream management system (RDSMS).
New!!: Backus–Naur form and SQL · See more »
Street or road name
A street or road name or odonym is an identifying name given to a street.
New!!: Backus–Naur form and Street or road name · See more »
Suffix (name)
A name suffix, in the Western English-language naming tradition, follows a person's full name and provides additional information about the person.
New!!: Backus–Naur form and Suffix (name) · See more »
Surname
A surname, family name, or last name is the portion of a personal name that indicates a person's family (or tribe or community, depending on the culture).
New!!: Backus–Naur form and Surname · See more »
Sweden
Sweden (Sverige), officially the Kingdom of Sweden (Swedish), is a Scandinavian country in Northern Europe.
New!!: Backus–Naur form and Sweden · See more »
Switzerland
Switzerland, officially the Swiss Confederation, is a sovereign state in Europe.
New!!: Backus–Naur form and Switzerland · See more »
Symbol
A symbol is a mark, sign or word that indicates, signifies, or is understood as representing an idea, object, or relationship.
New!!: Backus–Naur form and Symbol · See more »
Syntactic Structures
Syntactic Structures is a major work in linguistics by American linguist Noam Chomsky.
New!!: Backus–Naur form and Syntactic Structures · See more »
Syntax (programming languages)
In computer science, the syntax of a computer language is the set of rules that defines the combinations of symbols that are considered to be a correctly structured document or fragment in that language.
New!!: Backus–Naur form and Syntax (programming languages) · See more »
Syntax diagram
Syntax diagrams (or railroad diagrams) are a way to represent a context-free grammar.
New!!: Backus–Naur form and Syntax diagram · See more »
Terminal and nonterminal symbols
In computer science, terminal and nonterminal symbols are the lexical elements used in specifying the production rules constituting a formal grammar.
New!!: Backus–Naur form and Terminal and nonterminal symbols · See more »
Town
A town is a human settlement.
New!!: Backus–Naur form and Town · See more »
Translational Backus–Naur form
Translational Backus–Naur form (TBNF, or translational BNF) refers to Backus–Naur form, which is a formal grammar notation used to define the syntax of computer languages, such as Algol, Ada, C++, COBOL, Fortran, Java, Perl, Python, and many others.
New!!: Backus–Naur form and Translational Backus–Naur form · See more »
TREE-META
The TREE-META (or Tree Meta, TREEMETA) Translator Writing System is a compiler-compiler system for context-free languages originally developed in the 1960s.
New!!: Backus–Naur form and TREE-META · See more »
United Kingdom
The United Kingdom of Great Britain and Northern Ireland, commonly known as the United Kingdom (UK) or Britain,Usage is mixed with some organisations, including the and preferring to use Britain as shorthand for Great Britain is a sovereign country in western Europe.
New!!: Backus–Naur form and United Kingdom · See more »
Van Wijngaarden grammar
In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a two-level grammar which provides a technique to define potentially infinite context-free grammars in a finite number of rules.
New!!: Backus–Naur form and Van Wijngaarden grammar · See more »
Vertical bar
The vertical bar (|) is a computer character and glyph with various uses in mathematics, computing, and typography.
New!!: Backus–Naur form and Vertical bar · See more »
Whitespace character
In computer programming, white space is any character or series of characters that represent horizontal or vertical space in typography.
New!!: Backus–Naur form and Whitespace character · See more »
Wirth syntax notation
Wirth syntax notation (WSN) is a metasyntax, that is, a formal way to describe formal languages.
New!!: Backus–Naur form and Wirth syntax notation · See more »
XPL
XPL is a programming language based on PL/I, a portable one-pass compiler written in its own language, and a parser generator tool for easily implementing similar compilers for other languages.
New!!: Backus–Naur form and XPL · See more »
Yacc
Yacc (Yet Another Compiler-Compiler) is a computer program for the Unix operating system developed by Stephen C. Johnson.
New!!: Backus–Naur form and Yacc · See more »
Zellig Harris
Zellig Sabbettai Harris (October 23, 1909 – May 22, 1992) was a very influential American linguist, mathematical syntactician, and methodologist of science.
New!!: Backus–Naur form and Zellig Harris · See more »
ZIP Code
ZIP Codes are a system of postal codes used by the United States Postal Service (USPS) since 1963.
New!!: Backus–Naur form and ZIP Code · See more »
Redirects here:
BN Form, BN form, BN-form, BNF grammar, BNF notation, Backus Naur Form, Backus Naur form, Backus Normal Form, Backus normal form, Backus-Naur, Backus-Naur Form, Backus-Naur form, Backus-Naur notation, Backus-naur form, Backus–Naur, Backus–Naur Form, Backus–naur form, Panini-Backus Form, Panini-Backus form, Panini–Backus Form, Panini–Backus form.
References
[1] https://en.wikipedia.org/wiki/Backus–Naur_form