Notice that the statements are tracked in reverse as we Loop, and we reorder them only once we are Done. This is a very common pattern with loop! page 
If we consider the KWIC Indexing application of Fig. 15 instead of the 31 commonest English words, the Trie loses its advantage because of the nature of the data. For example, a trie requires 12 iterations to distinguish between COMPUTATION and COMPUTATIONS. In this case it would be better to build the trie so that words are scanned from right to left instead of from left to right. (TAOCP, v. 3, p. 494)
🔺
Regular expressions are quite confusing and difficult to use. This library provides a coherent alternative that handles more cases and produces clearer code. github , page
Practical Algorithm To Retrieve Information Coded In Alphanumeric’s basic idea is to build a binary Trie, but to avoid one-way branching by including in each node the number of bits to skip over before making the next test.
Motivated by a concrete problem and with the goal of understanding the relationship between the complexity of streaming algorithms and the computational complexity of formal languages, we investigate the problem Dyck(s) of checking matching parentheses, with s different types of parenthesis.