Parsing longer strings

[Advait Mohan Raut]

Hello friends,
I want to parse a string which has many tokens. Some tokens may be
present or absent.
eg.
A --B,C,D,E ;

B --b,M,N | null ;

C --O,c, (P|Q) ;

....
...
..
E --T, CR-LF, space;
....
....
....

end

such type of grammar, I want to parse and to read necessory tokens.
But no production rule is recursive or mutual recursive.
Is it worth to use Regex or Regex with named capturing?
If it is enough, then can someone point to some good tutorial for
regex with *named capturing* ?

Yours
Advait

[Advait Mohan Raut]

Hello friends,
In the above post, by the word 'longer stirings', I meant to say
size < 1k

yours
Advait

[=?Utf-8?B?RmFtaWx5IFRyZWUgTWlrZQ==?=]

"Advait Mohan Raut" wrote:

Hello friends,
I want to parse a string which has many tokens. Some tokens may be
present or absent.
eg.
A --B,C,D,E ;

B --b,M,N | null ;

C --O,c, (P|Q) ;

....
...
..
E --T, CR-LF, space;
....
....
....

end

such type of grammar, I want to parse and to read necessory tokens.
But no production rule is recursive or mutual recursive.
Is it worth to use Regex or Regex with named capturing?
If it is enough, then can someone point to some good tutorial for
regex with *named capturing* ?

Yours
Advait

I'm not sure I understand why standard string.Split() would not work. You
just need to be aware you will have null items where there are consecutive
tokens, such as in item C between the comma and open parenthesis. I may be
misunderstanding your context however, and (P|Q) is in your mind one value.