Geek Answers Handbook

Is there something like perl Regexp :: Grammars or tagged subpatterns in .NET?

I really like the perl module Regexp :: Grammars . Is there something similar for .NET?

I would really like to use a recursive descent parser in the style of a regular expression style (for example, searching for a suitable template through a large document) in C # and the ability to recursively express this template.

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

+4
source share
2 answers

Perl5 Regexp :: Grammars is modeled after Perl6 grammars .

Niecza is a Perl6 implementation that implements grammar and is aimed at

+5
source

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

+2
source

More articles:


All Articles