2014-06-10 2:23 GMT+02:00 GOUBIER Thierry <thierry.goubier@cea.fr>:

Hi all,

anybody would have a way to determine the maximum length / maximum complexity of a method in a Pharo out of a parse tree (or whether if the parse tree is over the limit)?

There are many different issues: maximum number of literals, maximum jump size, maximum number of temporaries. Can you precise what problem do you have ? What errors are raised ?

��

The code SmaCC generates easily hit compiler limits (methods too long or too complex), and I have difficulties changing the code generation approach.

For Pharo 4, we are implementing a new compiler back end that will remove some of those limits. I have a problem with code generation too and we are solving it.

Cl��ment

Thanks,

Thierry