Stack Overflow When Pyparsing Ada 2005 Scoped Identifiers Using Reference Manual Grammar
I'm currently implementing an Ada 2005 parser using Pyparsing and the reference manual grammar rules. We need this in order to analyze and transform parts of our aging Ada-codebase
Solution 1:
For reference, as noted in GNAT: The GNU Ada Compiler, §2.2 The Parser, "The Ada grammar given [in] the ARM is ambiguous, and a table-driven parser would be forced to modify the grammar to make it acceptable to LL (1) or LALR (1) techniques."
Post a Comment for "Stack Overflow When Pyparsing Ada 2005 Scoped Identifiers Using Reference Manual Grammar"