With uindex, you provide a Parsing Expression Grammar (PEG) [1], and you obtain a database that can hold, as data, unicode strings structured according to the top production of the provided PEG. You can then query the db for tokens corresponding to any of the (sub-) productions in the grammar.<p>This is a work in progress; for example, at the moment, dbs exist only in memory. In my opinion it shows promise, since as I show in the linked README, it performs in the league of in-memory SQLite.<p>Do you think it is worth investing more effort on this?<p>1.- <a href="https://en.wikipedia.org/wiki/Parsing_expression_grammar" rel="nofollow">https://en.wikipedia.org/wiki/Parsing_expression_grammar</a>