Overview

inherently ambiguous language


Show Summary Details

Quick Reference

A context-free language that has no nonambiguous grammar (see ambiguous grammar). An example is the set {aibjck | i = j or j = k}

{aibjck | i = j or j = k}

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.