Il 20/12/2013 22:21, Holger Hans Peter Freyther ha scritto: > Now my question is if the optimized token should recursively scan the > literals? Or should the RBScanner count $( and $) to know that it needs > to read one more item?
Keeping track of the number of parentheses, and exiting scanLiteralArray when it matches the count at entry, sounds like the easiest solution. Only #scanLiteralArray and #scanSpecialCharacter deal with parentheses. Paolo _______________________________________________ help-smalltalk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-smalltalk
