This article could probably be called “Left Recursion Considered Harmful“. PEG parsers are unambiguous and relatively easy to reason about. A little reasoning about left-recursive PEGs shows that they don’t make sense. The motivation to use left recursion seems to be driven by the desire to build left-associative parse-trees for arithmetic operators. However, parse-tree generation […]
Reference Pages
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution Erlang evaluation extensibility functional grammar Humus imperative JavaScript Kernel lambda-calculus language message-passing object-oriented pair pattern-matching PEG POLA primitive protocol queue recursion scalability Scheme security sequence serializer starvation state-machine streams synchronization synchronous value vau-calculusPost Calendar
Meta