Backus–Naurn.

/ˈbakəsˌnaʊə/

Etymology: < the names of John W. Backus (1924–2007), U.S. computer scientist, who first proposed the notation ( Information Processing (Proc. Internat. Conf. Information Processing, UNESCO, 1959) ii.125), and Peter Naur, 20th-cent. computer scientist, who revised it ( Communications Assoc. Computing Machinery (1960) III. 299).

Computing.

Backus–Naur form n. (formerly Backus normal form) a mode of formally describing the syntax of programming languages using a special notation; abbreviated BNF n. at B n. Additions.

ΘΚΠ

society > computing and information technology > programming language > [noun] > syntax > description of

Backus–Naur form1964

BNF1964

1961 Communications ACM 4 534/2 We now present a mechanical language designed for generative syntactic specification of digital linear sequential mechanical languages. Its use is called ‘specification by Backus normal form’, because John Backus of IBM introduced it.]

1964 D. E. Knuth in Communications Assoc. Computing Machinery 7 736/1 Actually, however, only (i) and (ii) were really used by John Backus when he proposed his notation; (iii), (iv), (v) are due to Peter Naur who incorporated these changes when drafting the ALGOL 60 report... Therefore I propose that henceforth we always say Backus Naur form instead of Backus Normal Form, when referring to such a syntax.

1967 Computer Group News Jan. 6/2 Programming syntax is commonly described in a notation called Backus–Naur Form (or BNF for short).

1989 Encycl. Brit. XVI. 634/1 The most widely used language for syntax description is the Backus–Naur form.

This entry has not yet been fully updated (first published 1997; most recently modified version published online June 2018).

单词	backus–naur
释义	Backus–Naurn. /ˈbakəsˌnaʊə/ Etymology: < the names of John W. Backus (1924–2007), U.S. computer scientist, who first proposed the notation ( Information Processing (Proc. Internat. Conf. Information Processing, UNESCO, 1959) ii.125), and Peter Naur, 20th-cent. computer scientist, who revised it ( Communications Assoc. Computing Machinery (1960) III. 299). Computing. Backus–Naur form n. (formerly Backus normal form) a mode of formally describing the syntax of programming languages using a special notation; abbreviated BNF n. at B n. Additions. ΘΚΠ society > computing and information technology > programming language > [noun] > syntax > description of Backus–Naur form1964 BNF1964 1961 Communications ACM 4 534/2 We now present a mechanical language designed for generative syntactic specification of digital linear sequential mechanical languages. Its use is called ‘specification by Backus normal form’, because John Backus of IBM introduced it.] 1964 D. E. Knuth in Communications Assoc. Computing Machinery 7 736/1 Actually, however, only (i) and (ii) were really used by John Backus when he proposed his notation; (iii), (iv), (v) are due to Peter Naur who incorporated these changes when drafting the ALGOL 60 report... Therefore I propose that henceforth we always say Backus Naur form instead of Backus Normal Form, when referring to such a syntax. 1967 Computer Group News Jan. 6/2 Programming syntax is commonly described in a notation called Backus–Naur Form (or BNF for short). 1989 Encycl. Brit. XVI. 634/1 The most widely used language for syntax description is the Backus–Naur form. This entry has not yet been fully updated (first published 1997; most recently modified version published online June 2018). < n.1964
随便看	timestate thromboplastin thromboplastins thrombopoiesis thrombopoietin thrombose thrombosed thromboses thrombosing thrombosis thrombospondin thrombosthenin thrombotic thromboxane thromboxanes thrombus thronal throne throne adversary throne and altar throne chair throne city throne gallery throne name throne of estate