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