| 释义 |
Backus–Naur, n. Computing.|ˈbækəsˌnaʊə(r)|
[The names of John W. Backus (b. 1924), 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).]
Backus–Naur form (formerly Backus normal form), a mode of formally describing the syntax of programming languages using a special notation; abbrev. BNF s.v. B III. 1.
[1961Communications Assoc. Computing Machinery IV. 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.] 1964D. E. Knuth in Ibid. VII. 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. 1967Computer Group News Jan. 6/2 Programming syntax is commonly described in a notation called Backus–Naur Form (or BNF for short). 1989Encycl. Brit. XVI. 634/1 The most widely used language for syntax description is the Backus–Naur form. |