Backus-Naur form

From PKC

Revision as of 11:21, 13 May 2022 by Benkoo (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://pkc.pub/index.php?title=Backus-Naur_form&oldid=30327"