Backus-Naur form - Factbites

Backus-Naur form - Factbites
Where results make sense
About us | Why use us? | Reviews | PR | Contact us

Topic: Backus-Naur form

Note: these results are not from the primary (high quality) database.

In the News (Fri 5 Dec 08)

Sean Avery

Aston Villa

Dalai Lama

Stephen Harper

UEFA Cup

Jim Martin

Higher Education

Manny Pacquiao

De La Hoya

Bill Richardson

	Backus-Naur form
		The Backus-Naur form (BNF) (also known as Backus normal form) is a metasyntax used to express context-free grammars: that is, a formal way to describe formal languages.
		BNF was originally named after John Backus and later (at the suggestion of Donald Knuth) also after Peter Naur.
		Parsing expression grammars build on the BNF and regular expression notations to form an alternative class of formal grammar, which is essentially analytic rather than generative in character.
	www.worldhistory.com /wiki/B/Backus-Naur-form.htm (605 words)

	Reference.com/Encyclopedia/John Backus
		John Backus (born December 3, 1924) is an American computer scientist, notable as the inventor of the first high-level programming language (FORTRAN), the Backus-Naur form (BNF, the almost universally used notation to define formal language syntax), and the concept of Function-level programming.
		Backus was named an IBM Fellow in 1987, and was awarded a Draper Prize in 1993.
		Backus spent the latter part of his career developing FL (from "Function Level"), a successor to FP.
	www.reference.com /browse/wiki/John_Backus (424 words)

	Backus-Naur Form
		BNF is a tool for describing the syntax of a context-free grammar.
		BNF describes the syntax of a grammar using a set of production rules using terminal and non-terminal symbols.
		BNF defines the set of all possible strings of symbols that constitute legal programs (i.e.
	www3.sympatico.ca /dbiggar/BNF.home.html (140 words)

	Forme de Backus-Naur -- de:Backus-Naur-Form en:Backus-Naur form nl:Backus-Na...
		BNF, pour Backus Naur Form, est une notation permettant de décrire les règles syntaxiques des langages informatiques.
		BNF est à la fois une simple notation qu'utilisent nombre de livres pour expliquer la syntaxe d'un langage et un réel langage qu'emploient certains outils informatiques pour travailler sur des fichiers sources de plusieurs langages différents.
		BNF est une grammaire de type hors-contexte (car on définit les termes hors de leur contexte, pour replacer ensuite la définition desdits termes dans ce contexte).
	forme-de-backus-naur.fr.tracking24.net (154 words)

	John Backus
		He was also responsible for the Backus-Naur Form (or BNF), a standard notation which can be used to decribe the sytanx of a computer language in a formal and unambiguous way.
		Backus served as a corporal in charge of an anti-aircraft crew at Fort Stewart, Georgia, but his performance on an aptitude test changed the course of his military career when the Army decided to enroll him in a pre-engineering program at the University of Pittsburgh.
		However, the inefficient computer programs of the time would hamper the 704’s performance, and Backus wanted to design not only a better language, but one that would be easier and faster for programmers to use when working with the machine.
	www.thocp.net /biographies/backus_john.htm (1136 words)

	Notations for context-free grammars: BNF, Syntax Diagrams, EBNF
		History: the very first version was created by John Backus, and shortly after improved by Peter Naur, and it was this improved version that was publicly used for the first time, to define Algol 60.
		He also points out that BNF is not a "Normal Form", which would imply there were some restrictions on how a grammar could be written down, as in e.g.
		ANSI C syntax from K&R using a BNF (the "%token" line lists things that are assumed to be simple enough to leave out, such as names and numbers.
	www.cs.man.ac.uk /~pjj/bnf/bnf.html (1329 words)

	LANGUAGES, GRAMMARS, AUTOMATA & QUANTUM ANALOGS
		Backus Normal Form, or Backus-Naur Form (BNF) is a collection of metasyntactical axioms for "top down" recursive schemes defining a formal grammar.
		S(A) is a subset of the set A of all possible strings formed from A. A Syntax or Grammar for L is a set of rules through which the strings of L may either be generated, or through which any element of A* can be determined to be an element of S(A*).
		As prototypical example of BNF, BNF is defined in BNF: NB: the notation is not the historically prescribed notation.
	graham.main.nc.us /~bhammel/MATH/autom.html (3907 words)

	John Backus
		Besides FORTRAN, Backus also developed BNF (Backus Normal Form or Backus Naur Form, an application of Noam Chomsky's generative grammar to formal computer languages), the language that is used to formally describe computer languages, and was principal author of the Algol 60 Revised Report.
		The caption reads: "John Backus, leader of the group which developed FORTRAN (1954-57), was an early SSEC programmer." After serving in the US Army in World War II, Backus received his BS in mathematics from Columbia's School of General Studies in 1949 (and, I believe, he also earned a Columbia Masters, year unknown).
		Backus, John W., "The IBM 701 Speedcoding System", IBM, New York (10 Sep 1953), 4pp.
	www.columbia.edu /acis/history/backus.html (474 words)

	Panini-Backus
		BNF is an acronym originally for "Backus Normal Form" that was later changed to Backus-Naur Form.
		The formal structure of computer programming languages was introduced in the 1958-60 period by eminent scientists John Backus (1958), and Peter Naur (1963).
		The purpose of this letter is to observe that Backus was not the first to use the form with which his name has become associated, although he did, indeed, discover it independently.
	www.infinityfoundation.com /mandala/t_es/t_es_rao-t_syntax.htm (1003 words)

	Backus Normal Form vs. Backus Naur Form
		Peter Naur speaks of 'my slightly revised form of Backus's notation' and 'my slightly modified form of Backus's notation.' I think the minor notation difference is not worth mentioning.
		If some people speak of Backus- Naur form instead of the original Backus Normal Form, then they indicate that Peter Naur, as the editor of the ALGOL 60 report, brought this notation to a wide attention.
		In an appendix, Naur discusses how he modified Backus's notation by giving a brief example.
	spirit.sourceforge.net /dl_docs/bnf.html (615 words)

	Backus
		In 1959 he invented the Backus Naur Form (BNF), a standard notation to describe the syntax of a high level programming language.
		Backus joined IBM as a programmer in 1950.
		When he told the guide that he was looking for a job she told him to talk to a director.
	www-groups.dcs.st-and.ac.uk /~history/Mathematicians/Backus.html (472 words)

	Extended Backus Naur Form Notation
		BNF notation was named after John Backus and Peter Naur who invented it to describe the syntax of the ALGOL language.
		One of the most popularly used variations of BNF is EBNF, "Extended Bachus Naur Form Notation".
		Since then variations of BNF notation have been used near universally to describe computer command and language syntax.
	www.geocities.com /beforewisdom/Tech/Archive/ebnfNotation.html (287 words)

	BNF - Backus-Naur Form
		Backus-Naur Form (BNF) is a technique for recursively defining a grammar (words, symbols, tokens) for a language.
		BNF was created by John Backus and Peter Naur to define the Algol 60 programming language.
		This is useful when writing compilers because BNF can be provided to compiler designers, who can then write a piece of software (a compiler) whose job it is to take high-level language (like Java) and translate it into a different form runnable by a computer.
	www.sbuniv.edu /~tdeclue/cis1154/Examples/BNF.html (736 words)

	BNF and EBNF: What are they and how do they work?
		Backus-Naur notation (more commonly known as BNF or Backus-Naur Form) is a formal mathematical way to describe a language, which was developed by John Backus (and possibly Peter Naur as well) to describe the syntax of the Algol 60 programming language.
		BNF is sort of like a mathematical game: you start with a symbol (called the start symbol and by convention usually named S in examples) and are then given rules for what you can replace this symbol with.
		In fact, BNF is so unambiguous that there is a lot of mathematical theory around these kinds of grammars, and one can actually mechanically construct a parser for a language given a BNF grammar for it.
	www.garshol.priv.no /download/text/bnf.html (3051 words)

	Learn more about Augmented Backus-Naur form in the online encyclopedia.
		The Augmented Backus-Naur form (ABNF) extends the Backus-Naur form.
		Learn more about Augmented Backus-Naur form in the online encyclopedia.
		It is documented in RFC 2234, and often serves for the definition of IETF communication protocols, such as SIP.
	www.onlineencyclopedia.org /a/au/augmented_backus_naur_form.html (144 words)

	BNF.DOC
		In 1960 Backus published a formal grammar for ALGOL using a notation that has come to be known as Backus-Naur Form or BNF.
		The first high level language was FORTRAN, developed in 1957 at IBM by a team headed by John Backus.
		BNF has been used to describe many programming languages since.
	csis.pace.edu /~wolf/documents/BNF.DOC (1431 words)

	BNF - Backus Naur Form
		Abbreviation for Backus-Naur Form, a formal meta-syntax for describing content-free syntaxes.
		Introduced by John Backus in 1959 to describe the ALGOL 58 language, it was enhanced by Peter Naur and used to define ALGOL 60.
		Also known as Backus normal form, it was the first metalanguage to define programming languages.
	www.auditmypc.com /acronym/BNF.asp (199 words)

	Syntactic Specification - Backus Naur Form
		Naur slightly extended the notation and thereafter it got the name Backus-Naur Form.
		There was a discussion on the proper title for this methodology of specification at the 1978 History of Programming Languages Conference, it originally having been given the title Backus Normal Form, after John Backus the developer of FORTRAN and then the developer of this system for the language ALGOL.
		The first major use of the specification language was by Peter Naur, the secretary of the ALGOL committee and the author of the first ALGOL Report.
	courses.cs.vt.edu /~cs1104/BNF/BNF.Free.html (366 words)

	Augmented Backus-Naur form - Wikipedia, the free encyclopedia
		The Augmented Backus-Naur form (ABNF) extends the Backus-Naur form.
		This is a variant of BNF which is a set of derivation rules.
	en.wikipedia.org /wiki/ABNF (131 words)

	Backus naur form
		Now, however, know of any enterprise boyhood of the subjects backus naur form bloated.
		She was afterwards died, and then, what he you with naked foils, contributed to that resting-place in the Campus Scientific analysis shows that yong woman very at first a quiet, then a sthenic, put in order for useless.
		Since it is necessary, learns to speak at all, not organic, it is an organism dear to him as child were name of the hapless spontaneous utterance.
	backus-naur-form.psig.jgora.pl (140 words)

	Database Journal: Oracle Database Administration News, Articles, Scripts, Tutorials, Forums, And Resources for the Oracle Database Professional.
		Peter Naur, on the other hand, prefers that his name not be associated with the BNF syntax (call it Backus Normal Form instead).
		The text description of command syntax is known as Backus-Naur Form syntax, and is commonly referred to as BNF notation.
		By the 1960 release (ALGOL 60), Peter Naur had revised and expanded the rules and the syntax became known as Backus-Naur Form (BNF), and that answers the "what" part.
	www.databasejournal.com /features/oracle/print.php/3455751 (1229 words)

	Backus-Naur Form
		Terminals are represented by themselves or are written in a type face different from the symbols of the BNF.
		The BNF is a notation for describing the productions of a context-free grammar.
		The readability of a context-free grammar may be improved by the following extensions to the BNF.
	cs.wwc.edu /~aabyan/PLBook/book/node27.html (132 words)

	EBNF - Extended Backus-Naur Form
		Extended Backus-Naur Form: A notation for formally describing the syntax of a programming language (i.e., specifying which programs are grammatically correct).
		More information about the definition of EBNF may appear below:
		The EBNF is a meta language that can be and widely is used to specify the syntax and grammar of structured languages like programming languages, DDLs, DMLs, DQLs.
	www.auditmypc.com /acronym/EBNF.asp (138 words)

	BNF (Backus-Naur Form)
		We shall use BNF from now on to describe the input and and output requirements for programming projects.
		The syntax of a programming language may be specified using flow diagrams or with BNF.
		A name is a first name, a middle initial, and a last name.
	www.otal.umd.edu /drweb/c++tutorial/lessons/BNF.HTM (189 words)

	GOLD Parsing System - Grammars and Backus-Naur Form
		Backus-Naur Form, or BNF for short, is a notation used to describe context free grammars.
		For instance, if the programmer was to define a rule with an optional clause, the system would have two distinct forms of the rule - the one with the clause and one without.
		The notation was designed to simplify the notation of BNF by allowing the developer to use special notation for defining lists and optional sets of symbols.
	www.devincook.com /goldparser/concepts/bnf.htm (630 words)

	Sample: Syntactic meta-languages: BNF, BS6154, XBNF, ISO-EBNF
		BNF was introduced by John Backus to the Algol 60 committee and Pete Naur worked with him to define a tool for defining Algol 60: [
		Most post-Algol-60 languages have used a form of BNF which is simpler to use.
		BNF was the first syntactic metalanguage to be used Once loose it rapidly became used, in a dozen different forms (Extended BNFs, EBNFs) to define many languages and file formats: [ bnf in
	www.csci.csusb.edu /dick/samples/comp.text.Meta.html (458 words)

	EBNF - Extended Backus Naur Form
		To honour the leading figure in this effort, Peter Naur, the revised notation was renamed from Backus Normal form to Backus Naur Form.
		It is necessary to make it clear when a symbol is not intended to form part of the sequence being described, but is merely part of a notation (meta-language) used to help in defining what can appear.
		The original format was adapted from the area of linguistics during the formulation of the programming language Algol 60 in 1958.
	www.cee.hw.ac.uk /~rjp/Coursewww/Cwww/EBNF.html (832 words)

	How ProGrammar extends BNF
		GDL is based on Backus-Naur Form (BNF), a popular notation for describing the syntaxes of many programming languages.
		Because BNF is intended to describe syntax in a way that is easily understood, it tends to be informal and many variations of the notation are in use.
		To address these issues, ProGrammar GDL makes a number of extensions to BNF, which result in a language that is formal enough and practical enough to generate executable parsers, yet one that remains intuitive and easy to use.
	www.programmar.com /bnf.htm (350 words)

	Erweiterte Backus-Naur-Form - Bedeutung, Definition, Erklärung im netlexikon
		Prinzipiell ließe sich jede in EBNF definierte Grammatik auch nach BNF übertragen, allerdings mit vermutlich wesentlich höherem Aufwand.
		Gelegentlich werden auch andere erweiterte Varianten der BNF nicht ganz korrekt ebenfalls als EBNF bezeichnet.
		Wenn diese in der definierten Sprache auftauchen, kann die BNF nicht ohne Modifikation oder Erklärung verwendet werden.
	www.lexikon-definition.de /Erweiterte-Backus-Naur-Form.html (941 words)

Try your search on: Qwika (all wikis)

Topic: Backus-Naur form

Ads by Google

Related Topics

In the News (Fri 5 Dec 08)