[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-smalltalk] RBScanner and compile time constants
|
From: |
Paolo Bonzini |
|
Subject: |
Re: [Help-smalltalk] RBScanner and compile time constants |
|
Date: |
Fri, 20 Dec 2013 23:11:16 +0100 |
|
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:17.0) Gecko/20130923 Thunderbird/17.0.9 |
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