Regular expressions that can be written as strings or as expression templates, and which can refer to each other and themselves recursively with the power of context-free grammars.
| Created Version: | boost-1.65.0 |
| Most Recent Modified Version: | boost-1.91.0 |
| Total Repositories: | 156 |
| Average New Repositories Per Year: | 8.00 |
| Most Recent Year Repository Count: | 4 |
| Most Used Year: | 2013 |
| Average Stars: | 274 |
| Activity Score: | 1.042 |
| Internal Consumers: | 103 |
| Contributors in Most Recent Version: | 2 |
| Total Contributors: | 27 |