Difference between revisions of "Backus-Naur form"

Revision as of 11:21, 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:20, 13 May 2022 (view source) Benkoo (talk \| contribs) (Created page with "{{WikiEntry\|key=Backus-Naur Form\|qCode=211577}} 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) Newer edit →
Line 1:		Line 1:
	{{WikiEntry\|key=Backus-Naur Form\|qCode=211577}} is one of the two main notation techniques for context-free grammars in computer science.		{{WikiEntry\|key=Backus-Naur Form\|qCode=211577}}, often abbreviated as [[BNF]], is one of the two main notation techniques for context-free grammars in computer science.