Re: Languages with optional spaces

Am 29.02.2020 um 10:48 schrieb Christopher F Clark:


> With a GLR parser (or something equivalent in power, e.g. an Earley
> parser or CYK) and a lexer that returns all possible sets of
> tokenizations one can find all the relevant parse trees and then see
> if only 1 makes semantic sense.


I wonder how those old coders could fit all that into about 4 KB ROM for
their BASIC interpreter ;-)


Isn't there a better solution nowadays than taking a sledgehammer to
crack a nut? The reconstruction of the proper original syntax requires
to disassemble the original code, so nothings hinders one from
implementing just that code on new hardware.


DoDi
[I suppose it depends on whether you want to understand what the old 6502
code did, or just run it. I'm also not sure I want to emulate whatever
passed for an arithmetic package on those machines. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.