| | 44 | Possible strategy for dealing with a big fat batch of profiling data: have a thing that can take an array similar to the one below and figure out if a profile matches it, starting from any point. The primary question is to figure out what kinds of patterns I'll want to look for and how powerful the pattern matcher will need to be. Also, this is starting to sound a lot like a grammar. That may be a clue, especially since nqp-rx is distributed with Parrot. |
| | 45 | |
| | 46 | {{{ |
| | 47 | [ |
| | 48 | [type=op, count=1, data={name=say, line=4}], #must have 'say' on line 4 |
| | 49 | [type=?, count=*], #0 or more lines of stuff I don't care about |
| | 50 | [type=op, count=2, data={name=say, line=10}], #another 'say' on line 10 |
| | 51 | ] |
| | 52 | }}} |