Re: OpenToken: Parsing Ada (subset)?

[Dennis Lee Bieber <wlfraed@ix.netcom.com>]

On Fri, 5 Jun 2015 13:49:02 -0700 (PDT), Shark8 <onewingedshark@gmail.com>
declaimed the following:

>On Friday, June 5, 2015 at 3:23:40 AM UTC-6, Georg Bauhaus wrote:
>> On 05.06.15 11:03, Stephen Leake wrote:
>> > Aflex compiles all the regular expressions for all of the tokens into
>> > one state machine, that visits each character in the input stream once.
>> > You can't get faster than that.
>> 
>> You can get faster than that if the OS supports
>> line-oriented I/O of text:
>> 
>> NotInString -> '-' ... -> '-' -> SKIPThisLine :)
>
>Hm, I seem to recall something about OpenVMS text-file that might qualify there.

	VMS had an abundance of RMS (Record Management Services) formats even
for text files -- one of which was "carriage control" (<lf> delimited
lines). And don't get me started on the FORTRAN "native" "segmented record"
type (a logical record is split across 1 or more physical records, wherein
each physical record had a marker bits for first, continuation, last
record, and a record length value; continuation basically set neither flag,
a short record would have first and last bits set).
-- 
	Wulfraed                 Dennis Lee Bieber         AF6VN
    wlfraed@ix.netcom.com    HTTP://wlfraed.home.netcom.com/