Possible bottle necks - Githubissues

varivera / aliasing-java

0 stars 0 forks source link

Open varivera opened 5 years ago

varivera commented 5 years ago

varivera commented 5 years ago

[ ] in x.v.w.t(): changing roots one by one might create an overhead. We could realise the chain (e.g. x.v.w) and make the root changing only once

varivera commented 5 years ago

[ ] So far, we are using binding information in the AST. However, I think this is not necessary as we are using compiled code (no type problems will be found). In such case, we could, in principle, get ride of the type information. In return, the analysis will perform faster as Binding information is expensive