Subject:
|
Re: NQC wishlist
|
Newsgroups:
|
lugnet.robotics.rcx.nqc
|
Date:
|
Wed, 5 Jan 2000 10:11:22 GMT
|
Viewed:
|
2083 times
|
| |
|
|
In lugnet.robotics.rcx.nqc, Dave Baum writes:
> Implementation of ## gets pretty nasty - at least within the current
> pre-processor design.
I believe the simplest way to do it would be to have an extra preprocessing
pass... it will slow down compilation a little, it's true, but maybe not that
much as to matter (compilation is anyway so much faster than the downloading
anyway)
then you can have two different, and simpler, lexers to do the job...
i suppose this won't get very high priority on your list, Dave, so I will try
to do it myself and wil let you know how it goes.
regards,
Vlad
|
|
Message has 1 Reply:
 | | Re: NQC wishlist
|
| (...) If I were to implement it, I probably wouldn't add a second pass. The real obstacle at present is that the literal text for a token cannot always be recovered after it leaves the lexer. For example, '01' and '1' both leave the lexer as an (...) (25 years ago, 6-Jan-00, to lugnet.robotics.rcx.nqc)
|
Message is in Reply To:
| | Re: NQC wishlist
|
| (...) Implementation of ## gets pretty nasty - at least within the current pre-processor design. I'll look at the C spec again, but I'm pretty sure ## forces a re-tokenization. In the current design of NQC, tokenization happens before (...) (25 years ago, 4-Jan-00, to lugnet.robotics.rcx.nqc)
|
17 Messages in This Thread:
 
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
