Difference between revisions of "Backus-Naur form"

Revision as of 11:22, 13 May 2022

Backus-Naur Form(Q211577), often abbreviated as BNF, is one of the two main notation techniques for context-free grammars in computer science.

Revision as of 11:21, 13 May 2022 (view source) Benkoo (talk \| contribs) ← Older edit	Revision as of 11:22, 13 May 2022 (view source) Benkoo (talk \| contribs) m (Benkoo moved page Backus-Naur Form to Backus-Naur form) Newer edit →
(No difference)