D120.de/forum

Is it correct to say that "Expression Result Caching" behaves exactly like our interpreter with EClosures and caches? I am asking because in that interpreter, all expressions that somehow end up in the store are being put in EClosures and therefore are all being cached. This would also include value...

Hey all,

so it seems that the internet doesn't know the answer to my question. Do you guys know? I mean, these concepts are relevant for the exam. I would really appreciate any help with this.

Best
Lucas

Hey all,

I think the title says it all. I asked this on StackOverflow and thought that maybe you guys cared...

https://stackoverflow.com/questions/322 ... ue-related

Best
Lucas

Hey,

I hate to be annoying but is there anything new on this? I do still believe there is an error in the interpreter. Thanks in advance!

Best
Lucas

Hey, could you please upload the KCFWAE interpreter? (Shame on me if I just didn't find it!) I find it very helpful to go through the test cases that are provided with all the interpreters, additionally I find it hard to implement it just from the slides since there are no usage examples given. Uplo...

Hi Toa, actually, the new stack frame only contains the self-binding. This is true despite the fact that all other stack frames are appended. And, if you take a look at how function definitions are being interpreted, only this very stack frame is taken from the top ('stack.head') and included in the...

Hey all, I am wondering why the 'namedExpr' in 'Rec' is being interpreted with a new stack frame 'extStack'. This new stack frame only contains the self-binding (boundId -> ...). Therefore, assuming that 'namedExpr' will turn out to be a closure, this closure will close over nothing but that self-bi...

A friend of mine and me have exactly the same passing percentage, no idea why... Any help would be appreciated.

Hi all, last Friday in the group exercise it was announced that we should take a look at fixed-point combinators before the next group exercise. It took me quite some time to find a non-cryptic explanation, but eventually I found one. So It thought I'd save you guys the trouble: https://medium.com/@...

I don't know what to say... Thanks man!

Hi, with my current implementation of substitution-based LetRec, one of the open test cases as well as two of the hidden ones fail: def test8 = expect(Num(120)) { interp(Let('fact, 42, App(fact, 5))) } Test test8 failed: can only apply functions, but got: Num(42) Isn't what my compiler does the corr...

Danke!

P.S.: Dein dritter Testfall müsste a=true, b=true sein. Tippfehler.

Merci

Ich wollte eigentlich wissen, ob die folgende Definition ausreichend ist:

Simple Condition Coverage := Jede Bool'sche Variable in der Condition des if-Statements hat einmal mit true und eimal mit false belegt zu sein.

Hi, ich glaube, ich habe Simple Condition Coverage nicht verstanden. So habe ich bisher gedacht, dass es funktioniert: Jede Bool'sche Variable in der Condition des if-Statements hat einmal mit true und eimal mit false belegt zu sein. Beispiel: if (a & b) { // No shortcut-eval! b is being looked at n...

Hallo, ich habe ein Verständnisproblem: Ich bin bisher davon ausgegangen, dass der Hauptunterschied zwischen traditionellen (z.B. Wasserfall-Prozess) und agilen Entwicklungsprozessen im Folgenden besteht: Während traditionelle Ansätze einmal (zu Beginn des Projekts) Requirements Enginnering betreibe...