Matches between min and max repetitions of a parser (inclusive). S -> A{m,n} Use -1 for max to represent unbounded repetition (equivalent to {m,})
| 437 | // S -> A{m,n} |
| 438 | // Use -1 for max to represent unbounded repetition (equivalent to {m,}) |
| 439 | common_peg_parser repeat(const common_peg_parser & p, int min, int max) { return add(common_peg_repetition_parser{p, min,max}); } |
| 440 | |
| 441 | // Matches exactly n repetitions of a parser. |
| 442 | // S -> A{n} |
no test coverage detected