Re: Spirit kleene/plus finite bounds
Michael Powell <[email protected]>
| Newsgroups | gmane.comp.parsers.spirit.general |
|---|---|
| Message-ID | <CAMEoF_G3CffUC21ZoVpDW3gJ3n0u56hp2d8vsY9L_0hqc3i-Dw@mail.gmail.com> |
On Sun, Nov 19, 2017 at 6:04 PM, Mikael Asplund <[email protected]> wrote: > Hello, Michael. > > Checked out the x3::repeat parser? :) Thank you, I certainly shall. > /Mikael > > -----Original Message----- > From: Michael Powell [mailto:[email protected]] > Sent: Sunday, November 19, 2017 18:39 > To: Spirit General Mailing List <[email protected]> > Subject: [Spirit-general] Spirit kleene/plus finite bounds > > Hello, > > I am familiar with the kleene and plus operators in parser grammars, per se. Is there a way to constrain the upper bounds? > > For example, in a Regex, I can specify a pattern appears N to M times, or just N times: > > MY_PATTERN{n,m} > > MY_PATTERN{n} > > With kleene, that would be 0 to how many times; and plus, 1 to how many times. > > Thanks! > > Cheers, > > Michael Powell > > ------------------------------------------------------------------------------ > Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot _______________________________________________ > Spirit-general mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/spirit-general > > ------------------------------------------------------------------------------ > Check out the vibrant tech community on one of the world's most > engaging tech sites, Slashdot.org! http://sdm.link/slashdot > _______________________________________________ > Spirit-general mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/spirit-general ------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot