Is it possible to have regexp that matches all valid regular expressions?

Posted by Juha Syrjälä on Stack Overflow See other posts from Stack Overflow or by Juha Syrjälä
Published on 2010-05-25T17:19:22Z Indexed on 2010/05/25 17:21 UTC
Read the original article Hit count: 259

Filed under:

computer-science

|

regular-language

|

regexp

Is it possible to detect if a given string is valid regular expression, using just regular expressions?

Say I have some strings, that may or may not be a valid regular expressions. I'd like to have a regular expression matches those string that correspond to valid regular expression. Is that possible? Or do I have use some higher level grammar (i.e. context free language) to detect this? Does it affect if I am using some extended version of regexps like Perl regexps?

If that is possible, what the regexp matching regexp is?

© Stack Overflow or respective owner

Related posts about computer-science

How do I completely self study computer science?

as seen on Programmers - Search for 'Programmers'
Being a completely self taught programmer I would like it if I could better myself by self-learning computer science course taught to a typical CS grad. Finding different resources on internet has been easy, there is of course MIT open course ware, and there are Coursera courses from Stanford and… >>> More
what, why, when, should I learn computer science?

as seen on Programmers - Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question: What is computer science? Should a web programmer learn computer science? If the answer of question 2 is yes, then what programming language(s)… >>> More
what, why, when, should I learn computer science?

as seen on Programmers - Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question: What is computer science is? Should a web programmer learn computer science? If the answer of question 2 is yes, then what programming… >>> More
What topic in computer science is this?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I am trying to figure out what 'topic' this is called, so I can learn more about it. Basically, I'm talking about designing my applications's architecture. I'm not talking about algorithms. More like -- this class should have these methods and these instance variables, and communicate with… >>> More
Computer Science Resume [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
I am looking for a good computer science resume. I just graduated, and I would like to see some samples from real programmers. The ones online don't seem that great. Sorry if this is posted in the wrong section. >>> More

Related posts about regular-language

What's a regular language?

as seen on Stack Overflow - Search for 'Stack Overflow'
I've read that you can't parse HTML with regular expressions because HTML is not a regular language. I tried searching Wikipedia, but I didn't understand a word of what the various related articles said. Can someone explain, in simpler terms, what's a regular (or non-regular) language, and why non-regular… >>> More
deriving regular expressions from a regular language

as seen on Stack Overflow - Search for 'Stack Overflow'
Given the language below, how do i find a regular expression for the language L = {a ^n b ^m | n = 1, m =1, nm =3} >>> More
Theory of Computation - Showing that a language is regular..

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm reviewing some notes for my course on Theory of Computation and I'm a little bit stuck on showing the following statement and I was hoping somebody could help me out with an explanation :) Let A be a regular language. The language B = {ab | a exists in A and b does not exist in A*} Why is B… >>> More
generalizing the pumping lemma for UNIX-style regular expressions

as seen on Stack Overflow - Search for 'Stack Overflow'
Most UNIX regular expressions have, besides the usual *,+,? operators a backslash operator where \1,\2,... match whatever's in the last parentheses, so for example L=(a)b\1* matches the (non regular) language a^n b a^n On one hand, this seems to be pretty powerful since you can create (a*)b\1b\1… >>> More
Regular Expression for any number divisible by 60 using C# .Net ?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi there, I need to apply validation on input time intervals that are taken in as seconds. Now i am not really good at Regular expressions. So can any body help making a regular expression that can test whether a number is divisible by 60. I was wondering if i could use to test one that check that… >>> More