| 翻訳と辞書 |
TBNF
TBNF is an acronym for the phrase, "Translational BNF". BNF refers to Backus Normal 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. TBNF goes beyond BNF and Extended BNF (EBNF) grammar notation because it not only defines the syntax of a language, but also defines the structure of the abstract-syntax tree (AST) to be created in memory and the output intermediate code to be generated. Thus TBNF defines the complete translation process from input text to intermediate code. Specification of the output intermediate code is optional, in which case you will still get automatic AST creation and have the ability to defined its structure in the grammar.
The TBNF concept was first published in April 2006 in a paper at SIGPLAN Notices, a special interest group of the ACM. See the TBNF paper (at ACM ).
Here is a sample grammar, specified in TBNF:
/
* Sample Grammar.
*/
/
* Input Tokens.
*/
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「TBNF」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|