Abstract
When working with LL parsers, the limiting factor to represent more complex parts of your grammar is determined by the amount of lookahead provided by your parsing library. Wouldn’t it be great, if we were able to completely remove this limitation, while still enjoying the benefits of LL parsers such as great error recovery and ease of debugging? This is exactly what ANTLR4’s adaptive LL(*) algorithm aims to accomplish. In this presentation, I will try to explain how the adaptive LL(*) strategy works in detail and how well it compares to common LL(k) parsers. For that, we will take a closer look at the Chevrotain LL(k) parsing library and empirically compare it to a version of itself with LL(*) lookahead.
Biography
Mark is a young passionate software engineer, who’s especially interested in designing solutions for other software engineers. After joining TypeFox in early 2021, he helped to design the language engineering framework Langium and also holds a stewardship for the Theia Cloud IDE project. Besides working on open source software, he helps businesses employ these frameworks in his role as a consultant.
How to join the event:
To avoid security issues is now necessary to register for the meeting. The registration should be necessary just once and be valid for all the next meetings you will participate in. Follow these steps:
- Register yourself to the community on the Homepage
- You will receive a confirmation email containing all the information about joining the meeting.
- Add to your calendar
- Enjoy the talk and, if you feel like it, discuss it further on the community forum