Related articles |
---|
[2 earlier articles] |
Re: 50 times longer to compile than copy vii@penguinpowered.com (John Fremlin) (2000-11-05) |
Re: 50 times longer to compile than copy s337240@student.uq.edu.au (Trent Waddington) (2000-11-05) |
Re: 50 times longer to compile than copy chase@naturalbridge.com (David Chase) (2000-11-07) |
Re: 50 times longer to compile than copy Sid-Ahmed-Ali.TOUATI@inria.fr (Sid Ahmed Ali TOUATI) (2000-11-07) |
Re: 50 times longer to compile than copy ONeillCJ@logica.com (Conor O'Neill) (2000-11-09) |
Re: 50 times longer to compile than copy lex@cc.gatech.edu (Lex Spoon) (2000-11-09) |
Re: 50 times longer to compile than copy christl@belinda.fmi.uni-passau.de (2000-11-09) |
Re: 50 times longer to compile than copy jacob@jacob.remcomp.fr (jacob navia) (2000-11-09) |
Re: 50 times longer to compile than copy vbdis@aol.com (2000-11-11) |
From: | christl@belinda.fmi.uni-passau.de (Timon Christl) |
Newsgroups: | comp.compilers |
Date: | 9 Nov 2000 16:50:47 -0500 |
Organization: | Compilers Central |
References: | 00-11-034 00-11-056 00-11-070 |
Keywords: | code, comment |
Posted-Date: | 09 Nov 2000 16:50:47 EST |
On 9 Nov 2000 12:10:08 -0500, Conor O'Neill wrote
>Question: would anyone consider it acceptable that a 'non-optimising'
>mode of a compiler used an 'if-else' sequence to implement all switch
>statements?
I'm reading the Dragon book at the moment and recently came across
switch statements in intermediate code generation. There are given two
alternatives, one is a series of if statements, the other involves
building a hash table. Now is this really commonly done or is it often
simply the if approach because it's simpler?
--
Timon Christl <christl@fmi.uni-passau.de>
[That's pretty typical, with a third alternative of a jump table if the
cases are all in sequence or close to it. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.