2 ms·
Ages ago, I tried to create a sparse bitmap for ANTLR’s storage of Unicode match sets. The paper’s algorithm I tried to implement was like compressed b-trees. I
by specialist 9y ago
Ages ago, I tried to create a sparse bitmap for ANTLR’s storage of Unicode match sets. The paper’s algorithm I tried to implement was like compressed b-trees. I didn’t get very far.
I’ve been wondering how parser generators now Unicode bitsets.