Related articles |
---|
[7 earlier articles] |
Re: Why are LR parsers faster than using if conditions haberg@matematik.su.se (Hans Aberg) (2004-06-28) |
Re: Why are LR parsers faster than using if conditions clint@0lsen.net (Clint Olsen) (2004-06-28) |
RE: Why are LR parsers faster than using if conditions quinn-j@shaw.ca (Quinn Tyler Jackson) (2004-06-30) |
Re: Why are LR parsers faster than using if conditions tmoog@panix.com (2004-06-30) |
Re: Why are LR parsers faster than using if conditions haberg@matematik.su.se (Hans Aberg) (2004-06-30) |
Re: Why are LR parsers faster than using if conditions christian.bau@cbau.freeserve.co.uk (Christian Bau) (2004-07-11) |
Re: Why are LR parsers faster than using if conditions try_vanevery_at_mycompanyname@yahoo.com (Brandon J. Van Every) (2004-07-13) |
Re: Why are LR parsers faster than using if conditions paulbmann@yahoo.com (Paul B Mann) (2004-07-28) |
From: | "Brandon J. Van Every" <try_vanevery_at_mycompanyname@yahoo.com> |
Newsgroups: | comp.compilers |
Date: | 13 Jul 2004 22:17:19 -0400 |
Organization: | Compilers Central |
References: | 04-06-122 04-06-126 04-07-004 |
Keywords: | parse, performance |
Posted-Date: | 13 Jul 2004 22:17:19 EDT |
Christian Bau wrote:
>
> And profiling probably prevented inlining - so your actual execution
> times might be much less than you thought.
Non-invasive sampling profilers are available, such as VTune.
--
Cheers, www.indiegamedesign.com
Brandon Van Every Seattle, WA
On Usenet, if you're not an open source hippie who
likes to download and play with programming toys
all day long, there's something wrong with you.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.