+Parsing is an old nut. Generations of software developers need to do parsing of data or text. +There are zillions of links, tools, papers and textbooks about parsing. One particular +book contains something +like 700 different algorithm, nicely analysed and described. Surely, parsing must be a solved problem. Or is it? +Laurie Tratt has a blog post +about Parsing: The Solved Problem That Isn't. IMHO parsing is still a wide open field and not solved at all. +PEG parsing, error reporting, error correction, runtime to name just a few are aspects that seem to cause headaches +to developers, and to researchers.
+ ++A recent paper +(not even published yet) follows an idea for regular expressions: it adapts the notion of +derivatives of regular expressions to grammars. The idea is to implement in a functional programming language +the parsing algorithm proposed in this paper and to try it out with some sample data. +
+ Literature: paper +Skills: See [CU1]. ++Webassembly is a recently agreed standard for speeding up web applications in browsers. In this +project the aim is to implement an interpreter or compiler for webassembly. There are already +reference interpreters, +but people take different views, for example implement a +Forth language on top of webassembly. +What is good about webassembly is that is a rather simple format, which can be generated quite +easily, unlike Java class files, which need some head-standing when you generate them. +
+ Reference Interpreter