02-Mar-2013 13:33, Namespace пишет:
For one of our courses this year we have a very cool topic: Lexer and
Compiler.
In the past I have already tried some experiments in this direction with
Romulus and Remus, but I've never measured my Lexing time.
That's why I wanted to start again to write a lexer (hitherto purely for
the learning effect).
I looked at the code of some of the other lexers, that are also written
in D, to get some inspiration from, but currently my Lexer is a little
bit slow, it requires for example ~200 msecs for std.datetime.
So I wanted to ask whether there are nice people who help me to improve
our lexer.
Code: https://github.com/Dgame/Puzzle/blob/master/lexer.d
Thanks in advance. :)
See this one I'm currently investing my time into:
https://github.com/Hackerpilot/Dscanner/tree/range-based-lexer
Other then this use cachegrind and compile with ldc/gdc :)
Also for dmd check the flags are "-release -O -inline -noboundscheck"
--
Dmitry Olshansky
