Information: - From Oct. 2005 to Sep. 2007, he served as Dean of Faculty of Environment and Information Studies, Keio University. - In computer science, extended BackusNaur form (EBNF) is a family of metasyntax notations, any of which can be used to express a context-free grammar. EBNF is used to make a formal description of a formal language which can be a computer programming language. They are extensions of the basic BackusNaur form (BNF) metasyntax notation. - Broadly, any metalanguage is language or symbols used when language itself is being discussed or examined. In logic and linguistics, a metalanguage is a language used to make statements about statements in another language (the object language). Expressions in a metalanguage are often distinguished from those in an object language by the use of italics, quotation marks, or writing on a separate line. The structure of sentences and phrases in a metalanguage can be described by a metasyntax. - 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. Natural languages can take different forms, such as speech, signing, or writing. They are distinguished from constructed and formal languages such as those used to program computers or to study logic. - The Syntax Definition Formalism ( SDF ) is a metasyntax used to define context - free grammars : that is , a formal way to describe formal languages . It can express the entire range of context - free grammars . Its current version is SDF3 . A parser and parser generator for SDF specifications are provided as part of the free ASF + SDF Meta Environment . These operate using the SGLR ( Scannerless GLR parser ) . An SDF parser outputs parse trees or , in the case of ambiguities , parse forests . - 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. Some of the widely used formal metalanguages for computer languages are BackusNaur form (BNF), extended BackusNaur form (EBNF), Wirth syntax notation (WSN), and augmented BackusNaur form (ABNF). - The ASF+SDF Meta-Environment is an IDE and toolset for interactive program analysis and transformation. It combines SDF (Syntax Definition Formalism), ASF (Algebraic Specification Formalism) and other technologies. - In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation, while an unambiguous grammar is a context-free grammar for which every valid string has a unique leftmost derivation. Many languages admit both ambiguous and unambiguous grammars, while some languages admit only ambiguous grammars. Any non-empty language admits an ambiguous grammar by taking an unambiguous grammar and introducing a duplicate rule or synonym (the only language without ambiguous grammars is the empty language). A language that only admits ambiguous grammars is called an inherently ambiguous language, and there are inherently ambiguous context-free languages. Deterministic context-free grammars are always unambiguous, and are an important subclass of unambiguous grammars; there are non-deterministic unambiguous grammars, however. - In computer science, BackusNaur form or Backus normal form (BNF) is a notation technique for context-free grammars, often used to describe the syntax of languages used in computing, such as computer programming languages, document formats, instruction sets and communication protocols. They are applied wherever exact descriptions of languages are needed: for instance, in official language specifications, in manuals, and in textbooks on programming language theory. - A GLR parser (GLR standing for "generalized LR", where L stands for "left-to-right" and R stands for "rightmost (derivation)") is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. The theoretical foundation was provided in a 1974 paper by Bernard Lang (along with other general Context-Free parsers such as GLL). It describes a systematic way to produce such algorithms, and provides uniform results regarding correctness proofs, complexity with respect to grammar classes, and optimization techniques. The first actual implementation of GLR was described in a 1984 paper by Masaru Tomita, it has also been referred to as a "parallel parser". Tomita presented five stages in his original work, though in practice it is the second stage that is recognized as the GLR parser. - A programming language is a formal computer language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs to control the behavior of a machine or to express algorithms. - In computer science, LR parsers are a type of bottom-up parsers that efficiently handle deterministic context-free languages in guaranteed linear time. The LALR parsers and the SLR parsers are common variants of LR parsers. LR parsers are often mechanically generated from a formal grammar for the language by a parser generator tool. They are very widely used for the processing of computer languages, more than other kinds of generated parsers. - In computer science, augmented BackusNaur form (ABNF) is a metalanguage based on BackusNaur form (BNF), but consisting of its own syntax and derivation rules. The motive principle for ABNF is to describe a formal system of a language to be used as a bidirectional communications protocol. It is defined by "Internet Standard 68" ("STD 68", type case sic), which is RFC 5234, and it often serves as the definition language for IETF communication protocols. - Wirth syntax notation (WSN) is a metasyntax, that is, a formal way to describe formal languages. Originally proposed by Niklaus Wirth in 1977 as an alternative to BackusNaur form (BNF). It has several advantages over BNF in that it contains an explicit iteration construct, and it avoids the use of an explicit symbol for the empty string (such as <nowiki><empty></nowiki> or ). After reading the paragraphs above, we are interested in knowing the entity with which 'syntax definition formalism' exhibits the relationship of 'instance of'. Find the answer from the choices below. Choices: - behavior - case - computer - definition - derivation - document - environment - faculty - family - five - formal grammar - formal language - formalism - foundation - glr parser - humans - information - language - line - logic - metalanguage - metasyntax - notation - object - official - ordinary - paper - philosophy - principle - programming - programming language - protocol - quotation - science - speech - stage - standard - string - structure - study - time
Answer:
programming language