On Feb 15, 9:59 am, "Edward K. Ream" <[email protected]> wrote:
> 1. One of the biggest surprise of my programming life was the > realization that multi-pass compiler algorithms can be significantly > *faster* than single-pass algorithms. At the time, that was a huge > shock. Now, it seems second nature to me. So the first part of the > strategy is that the new pylint will consist of multiple passes, > largely independent of each other. This will have salutary effects > everywhere. I consider the anticipated preprocessing passes to be similar in complexity to peephole optimizers in an optimizing compiler. I've written them for the C language. It is amazing how effective and fast peepholes can be. I want to convert ast trees to trees of pylint nodes so that the "peepholes" will have complete freedom to munge the tree as they please. In effect, only the peepholes will detail with the grungy details of ast syntax and semantics. After the peepholes are done, the rest of pylint will have the easiest-possible data to work with. And make no mistake: data, not code, is the key to simplifying a program. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/leo-editor?hl=en.
