Recent searches
Search options
Can all Context-Free Grammars be described in Backus-Naur Form/Syntax?
Is BNF a "form" like Chomsky Normal Form or Greiback Normal Form, or is it just a "syntax" that can encode all CFG's and all BNF documents describe a CFG (a bijective encoding)?
The internet only tells me things that are so Basic I don't trust them to know about such questions, or so advanced they already assume I know the answer to this X'D
#Math
#FormalGrammars
#ContextFreeGrammar
#BNF #EBNF #BackusNaur
#Parsing #Parsers
@codepuppy Would you like this boosted?
@Canageek Sure, thanks! :D
Always feel free to boost my posts if/whenever you like :>
It seems that BNF was in fact inspired by Chomsky Normal Form, but it's not exactly a normal form, just a form of encoding a grammar (according to https://en.m.wikipedia.org/wiki/Backus%E2%80%93Naur_form )
@aster Yessssssssss confirmation! Thank youuuuu :D
Now I can just represent the *data model* of BNF as "Context-Free Grammar", with BNF being a syntax/encoding of it! ^w^