Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| State of the Art peter.deussen@fokus.fraunhofer.de (Peter) (2008-07-18) |
| Re: State of the Art jaluber@gmail.com (Johannes) (2008-07-20) |
| Re: State of the Art DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-07-21) |
| Re: State of the Art peter.deussen@fokus.fraunhofer.de (Peter) (2008-07-21) |
| RE: State of the Art quinn_jackson2004@yahoo.ca (Quinn Tyler Jackson) (2008-07-21) |
| Re: State of the Art parrt@cs.usfca.edu (Terence Parr) (2008-07-21) |
| Re: State of the Art ademakov@gmail.com (Aleksey Demakov) (2008-07-23) |
| Re: State of the Art cfc@shell01.TheWorld.com (Chris F Clark) (2008-07-22) |
| Re: State of the Art torbenm@pc-003.diku.dk (2008-07-23) |
| Re: State of the Art ang.usenet@gmail.com (Aaron Gray) (2008-07-24) |
| Re: State of the Art dot@dotat.at (Tony Finch) (2008-07-25) |
| Re: State of the Art johnhull2008@gmail.com (johnhull2008) (2008-07-28) |
| Re: State of the Art kamalpr@hp.com (kamal) (2008-07-28) |
| [2 later articles] |
| From: | "Aleksey Demakov" <ademakov@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | Wed, 23 Jul 2008 00:13:38 +0700 |
| Organization: | Compilers Central |
| References: | 08-07-040 08-07-042 |
| Keywords: | practice |
| Posted-Date: | 25 Jul 2008 07:44:31 EDT |
Hi all,
The replies almost exclusively go about parser algorithms. But many
people still use old good yacc-based, or manually written recursive
descent parsers. Perhaps this is because they do the job as well.
On the other hand everyone (at least this is my layman impression)
seems to use such things as SSA-based redundancy elimination, graph
coloring register allocation. But these algorithms are not new.
Is there anything relatively new (say not described by Muchnik) that
became or going to become widely used? Something that clearly wins
over older algorithms.
Regards,
Aleksey
Return to the
comp.compilers page.
Search the
comp.compilers archives again.