Timeline for Circular dependencies: Recursive grammar parser (e.g. json)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2016 at 9:52 | comment | added | Jules | It appears to correspond to your argument method, but then uses higher-order functions to make the arguments implicit, resulting in something close to your proxy, only based on functions rather than objects. | |
| Jan 9, 2016 at 9:50 | comment | added | Jules | I don't recognise the language either, but it is very similar to Haskell (the only difference I see are the use of ':' to introduce a type signature while Haskell uses '::' and 'forall v .' to introduce a type variable which Haskell does implicitly). | |
| Jan 9, 2016 at 8:17 | comment | added | donquixote | And, do you think this matches any of the patterns/solutions mentioned above? (argument, stub, proxy) | |
| Jan 9, 2016 at 8:15 | comment | added | donquixote | Hu.. I suppose this is pseudocode, but what kind of language is it based on? I am not familiar with it. | |
| Jan 8, 2016 at 21:59 | history | answered | walpen | CC BY-SA 3.0 |