Regex BNF Grammar

regex grammar bnf
Julien Grenier picture Julien Grenier · Nov 5, 2008 · Viewed 17.2k times · Source

Is there any BNF grammar for regular expression?

Answer

VonC picture VonC · Nov 5, 2008

You can see one for Perl regexp (displayed a little more in detail here, as posted by edg)

Related questions

What is a Context Free Grammar?

Can someone explain to me what a context free grammar is? After looking at the Wikipedia entry and then the Wikipedia entry on formal grammar, I am left utterly and totally befuddled. Would someone be so kind as to explain …

Read More
Convert regular expression to CFG

How can I convert some regular language to its equivalent Context Free Grammar? Is it necessary to construct the DFA corresponding to that regular expression or is there some rule for such a conversion? For example, consider the following regular …

Read More
Regular expression to match string of 0's and 1's without '011' substring

I'm working on a problem (from Introduction to Automata Theory, Languages and Computer by Hopcroft, Motwani and Ullman) to write a regular expression that defines a language consisting of all strings of 0s and 1s not containing the substring 011. Is …

Read More