Is there anything like perl's Regexp::Grammars or labeled subpatterns in .NET?

Question

I really like perl's Regexp::Grammars module. Is there anything like this for .NET?

I'd really like to use a recursive descent parser in a regex style way (eg searching for a matching pattern through a large document) in C#, and be able to express that pattern recursively.

Update After reading this little gem from brian d foy, I discovered that perl 5.10 supports labeled subpatterns using (?&NAME). PCRE now has a Nuget package, and PCRE supports named/labeled subpatterns.

score 5 · Accepted Answer · answered Aug 06 '12 at 10:36

5

Perl5 Regexp::Grammars is modeled after Perl6 grammars.

Niecza is a Perl6 implementation that implements grammars and targets the CLI, which .NET also does.

answered Aug 06 '12 at 10:36

daxim

38,703
4
63
128

interesting. I wonder if I could create a .NET class or DLL using Niecza and then call it from c#? – Matthew Lock Aug 07 '12 at 00:22

score 2 · Answer 2 · edited May 23 '17 at 12:20

2

I don't think that there is a comparable module, but you can create recursive regexes in .NET. See here for an example.

edited May 23 '17 at 12:20

Community

1
1

answered Aug 06 '12 at 09:32

Tim Pietzcker

313,408
56
485
544

Is there anything like perl's Regexp::Grammars or labeled subpatterns in .NET?

2 Answers2