-
Notifications
You must be signed in to change notification settings - Fork 1
Homework #4 #11
Comments
I am having an issue related to the fact that I was not able to find the information necessary to complete this assignment on the slides. We have to implement different strategies, and on the slides, I was able to find the information regarding the bottom-up strategy with an example. When tasked with finding [AF AG x], the steps are to find x first, then find AG x, and then AF AG x. I understand how this works. However, there was no information regarding the other 5 strategies. For example, how do we go about doing this using the top-down strategy? What about the innermost strategy? Outermost strategy? One strategy? All strategy? Is there a place where this information is given? If so, where? I looked at the README file, and the CTL slides, but I did not find answers to these questions. Thanks. |
It seems that you did not look at the right slides. TP 4 is about rewriting, not CTL, so look at these slides. |
To all students: In the question "create an ADT that will test correctly all the strategies; it must be non-confluent to allow your tests to distinguish innermost and outermost for instance" of the homework, you have to create an ADT that is meaningful, and that has not already been seen in the course or exercises. |
Oh, I see, thanks, I'll take a look. |
Is there any way to obtain more information on the outmost strategy, as well as one strategy? Or an example that demonstrates how the bottomup and innermost strategies are different? Thanks. |
We have worked on the difference between outermost and innermost during exercises, for instance here. The other strategies are explained in the course. |
Homework #4 has been released. Deadline is 29 november 2017 at 23:59.
Look at the course homepage for more information.
The text was updated successfully, but these errors were encountered: