Related articles |
---|
=?UTF-8?Q?Bison_determinis=E2=80=8Btic_LALR=281=29_parser_for_Java=2FC hsad005@gmail.com (2012-08-17) |
Re: Bison =?UTF-8?B?ZGV0ZXJtaW5pc+KAi3RpYyBMQUxSKDEpIHBhcnNlciBm?= =?U DrDiettrich1@aol.com (Hans-Peter Diettrich) (2012-08-18) |
Re: Bison =?UTF-8?B?ZGV0ZXJtaW5pc+KAi3RpYyBMQUxSKDEpIHBhcnNlciBm?= =?U anton@mips.complang.tuwien.ac.at (2012-08-20) |
Re: Bison =?UTF-8?B?ZGV0ZXJtaW5pc+KAi3RpYyBMQUxSKDEpIHBhcnNlciBm?= =?U cr88192@hotmail.com (BGB) (2012-08-21) |
=?UTF-8?Q?Re:_Bison_determinis=E2=80=8Btic_LALR=281=29?= =?UTF-8?Q?_pa bc@freeuk.com (BartC) (2012-08-22) |
Re: Bison =?UTF-8?B?ZGV0ZXJtaW5pc+KAi3RpYyBMQUxSKDEpIHBhcnNlciBm?= =?U cr88192@hotmail.com (BGB) (2012-08-26) |
Bison deterministic LALR parser for Java/C++ bc@freeuk.com (BartC) (2012-08-29) |
speeding up C recompilation, was Re: Bison deterministic LALR cr88192@hotmail.com (BGB) (2012-09-04) |
Re: C include handling, was Bison deterministic LALR marcov@toad.stack.nl (Marco van de Voort) (2012-09-05) |
From: | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
Newsgroups: | comp.compilers |
Date: | Mon, 20 Aug 2012 13:35:57 GMT |
Organization: | Institut fuer Computersprachen, Technische Universitaet Wien |
References: | 12-08-005 12-08-006 |
Keywords: | bison, design performance |
Posted-Date: | 20 Aug 2012 22:06:03 EDT |
Hans-Peter Diettrich <DrDiettrich1@aol.com> writes:
>> [Get it working in bison, then in the unlikely event that's not fast
>> enough, profile your compiler to see where it's spending its time and
>> fix what needs to be fixed. Although in theory GLR can be very slow,
>> in practice the ambiguities are generally resolved within a few tokens
>> and the performance is fine. compilers always spend way more time in
>> the lexer than the parser anyway. Writing RD parsers by hand can be
>> fun, but you never know what language it actually parses. -John]
>
>There exist parser generators for several models. I also doubt that -
>except in misdesigned C-ish languages - a compiler spends significant
>time in the lexer. This may be true for dummy parsers, which do
>nothing but syntax checks, but not for compilers with code generation,
>optimization and more.
Code generation and optimization do not change the relation between
the time spent in scanning and in parsing. Moreover, if the compiler
spends most of the time in code generation, optimization and/or
"more", there is even less reason to worry about parsing speed.
- anton
--
M. Anton Ertl
anton@mips.complang.tuwien.ac.at
http://www.complang.tuwien.ac.at/anton/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.