13-Sep-2013 00:46, Robert Schadek пишет:
On 09/12/2013 04:21 AM, Martin Nowak wrote:
On 09/12/2013 03:39 AM, Walter Bright wrote:
On 9/11/2013 6:30 PM, deadalnix wrote:
Indeed. What solution do you have in mind ?
The solution dmd uses is to put in an intermediary layer that saves the
lookahead tokens in a linked list.
Linked list sounds bad.
Do you have a rough idea how often lookahead is needed, i.e. is it
performance relevant? If so it might be worth tuning.
Maybe some fixed size stack vector with 64 elements or so and some
linked list for the unusual case would help ..
And an extra branch to detect which one is currently the case? No, thanks ;)
--
Dmitry Olshansky
