This project is a fully-extended implementation of the algorithm ℳ from Annika Aasa's "Precedences in specifications and implementations of programming languages". It provides an interface for converting distfix (mixfix) precedence grammars into unambiguous context-free grammars.
-
Notifications
You must be signed in to change notification settings - Fork 0
Convert distfix precedence grammars to unambiguous context-free grammars.
License
mobotsar/aasam
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Convert distfix precedence grammars to unambiguous context-free grammars.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published