Ambiguity

Haruo HosoyaCambridge 2010 · DOI · OpenAlex

Abstract

Ambiguity refers to the property whereby regular expressions or patterns have multiple matching possibilities. As discussed in Chapter 5, ambiguity can make the behavior of a program harder to understand and can actually be the result of a programming error. Therefore it is often useful to report it to the user. However, when we come to ask exactly what we mean by ambiguity, there is no consensus. In this chapter, we review three different definitions, strong ambiguity, weak ambiguities and binding ambiguity, and discuss how these notions are related to each other and how they can be checked algorithmically.
BibTeX
@inproceedings{hosoya2010ambiguity,
  author = {Haruo Hosoya},
  title = {{Ambiguity}},
  booktitle = {Cambridge},
  year = {2010},
  doi = {10.1017/cbo9780511762093.015},
}

Loading related content...

Figure