Prove that the language of naturals is unambiguous

noughtmare / parsing-ddgs

Parsing Data-Dependent Grammars using Derivatives

0 stars 0 forks source link

Prove that the language of naturals is unambiguous #4

Closed noughtmare closed 3 weeks ago

noughtmare commented 3 weeks ago

I've started proving some very simple language unambiguous, but I've gotten a bit stuck on natLang which is the language of natural numbers. The issue is that it uses a dependent sigma type, which is nontrivial to deal with.

Solving this issue is a requirement before we can move on to more complicated languages like #3