A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Expressing disambiguation filters as combinators
2020
Proceedings of the 35th Annual ACM Symposium on Applied Computing
Contrarily to most conventional programming languages where certain symbols are used so as to create non-ambiguous grammars, most recent programming languages allow ambiguity. These ambiguities are solved using disambiguation rules, which dictate how the software that parses these languages should behave when faced with ambiguities. Such rules are highly efficient but come with some limitations -they cannot be further modified, their behaviour is hidden, and changing them implies re-building a
doi:10.1145/3341105.3374123
dblp:conf/sac/MacedoS20
fatcat:hkkpk2pgyzdopmakwz4ez6r7qm