Some problems of recursive descent parsers
Summary
The article analyzes problems of recursive descent parsers, focusing on operator associativity and the limitations of plain BNF. It demonstrates how right-associativity can arise in RD parsers and presents an EBNF-based solution with a left-to-right loop to achieve correct associativity and improve efficiency, including Python code examples and references to a GitHub repository.