Explore >> Select a destination
|
You are here 
|
www.integralist.co.uk | ||
| | | | |
blog.jak-linux.org
|
|
| | | | | Writing recursive descent parsers is easy, especially in Python (just like everything is easy in Python). But Python defines a low limit on the number of recursive calls that can be made, and recursive descent parsers are prone to exceed this limit. We should thus write our parser without real recursion. Fortunately, Python offers us a way out: Coroutines, introduced in Python 2.5 as per PEP 342. Using coroutines and a simple trampoline function, we can convert every mutually recursive set of functions into a set of coroutines that require constant stack space. | |
| | | | |
abhinavomprakash.com
|
|
| | | | | Defining recursion in terms of itself is an old joke among programmers. Despite the fact that it frustrates a lot of new-comers, we don't change it. I like to define recursion as "Iteration for the cool kids". I don't mean this in a snobbish, let-us-exclude-the-for-loopers kinda way, but rather in a tone of appreciation. Recursion is an elegant way of doing things. Recursive alogrithms are concise, have less noise and have immutability baked in (always a plus). | |
| | | | |
blog.scottlogic.com
|
|
| | | | | WebAssembly is a performance optimised virtual machine that was shipped in all four major browsers earlier this year. It is a nascent technology and the current version is very much an MVP. This blog post takes a look at the WebAssembly roadmap and the features it might gain in the near future. | |
| | | | |
eli.thegreenplace.net
|
|
| | | |||
