Get the latest tech news
Regular, Recursive, Restricted
A post/question about formal grammars, wherein I search for a good formalism for describing infix expressions.
Given a labeled tree, its trivial to check whether itmatches the grammar: for each node, you can directly match the regular expression. Checking whether a tree conform to this modified set of rules is easy as negative rulesare also just regular expressions. And I am pretty sure that I can prove, by hand, that it is in factunambiguous (well, I might discover that I miss a couple of restrictions in process, but it feelslike it should work in principle).
Or read this on Hacker News