[Lazarus] How to write an eficient lexical scanner/parser?
silvioprog at gmail.com
Wed Mar 11 03:04:49 CET 2015
On Fri, Mar 6, 2015 at 3:15 PM, Kostas Michalopoulos <
badsectoracula at gmail.com> wrote:
> This is a classic series of articles that show how to write a very simple
> compiler in Turbo Pascal. The fundamentals when it comes to scanning are
> the same:
> I've also written a BASIC implementation for Free Pascal and Lazarus. The
> scanner should be straightforward to understand:
> The compiler code shows how it can be used:
> But you may also find the formatter code simpler. Although it is a bit too
> For general theory you can look on recursive descent parsers (they're the
> simplest to implement and AFAIK most compilers use them, either to build
> the token list or directly).
I downloaded the PDF with all articles.
Thank you very much!
My public projects - github.com/silvioprog
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Lazarus