Return to Question

Suppose you have existing regexes you wish to compile using one of the submissions to Compile Regexes.

Suppose you have existing regexes you wish to compile using one of the submissions to Compile Regexes.

Suppose you have existing regexes you wish to compile using one of the submissions to Compile Regexes. In as few characters as possible, write a program to make that work.

For reference, you can convert...

Suppose you have existing regexes you wish to compile using one of the submissions to Compile Regexes. 

In as few characters as possible, write a program that:

• accepts an existing regex as input, as either (a) one line from standard input; or (b) one argument from the command line; or (c) the contents of a textbox in a dialog box; then
• converts the regex into one that works with the compiler (see "Equivalent constructs"); then
• prints the new regex either (a) on standard output; or (b) in a dialog box.

You can convert...

• You may assume all non-alphanumeric characters are metacharacters.
• Do not use general-purpose or Unicode algorithms to compress your code.
• Methods of input and output are implementation defined yet may not trivialize the solution.
• Using a special-purpose regex parsing library is prohibited.
• The input will never be longer than 1000 bytes.

• Valid: partsexpress, sextet, unisex
• Invalid: partSEXpress, SEXtet, uniSEX

• You may assume all non-alphanumeric characters are metacharacters.
• Do not use general-purpose or Unicode algorithms to compress your code.
• Methods of input and output are implementation defined yet may not trivialize the solution.
• Using a special-purpose regex parsing library is prohibited. However, using one or more regexes as a tool for parsing the regex is OK (see below Scoring section).
• The input will never be longer than 1000 bytes.

• Valid: partsexpress, sextet, middlesex
• Invalid: partSEXpress, SEXtet, middleSEX