Arc Forumnew | comments | leaders | submit login

3 points by pg 6159 days ago | link | parent It's fairly easy to do by hand. Just count the number of tokens-- in the sense of things whose first character a parser would not treat as merely another character in the name it was previously reading-- that are not closing delimiters of a pair.