I know that there are some languages that are unambiguous but not context-free (this is a good fact). Is there any kind of formalism for describing unambiguous context-sensitive languages? Even better yet, is there a parsing algorithm for unambiguous context-sensitive languages?
$\begingroup$
$\endgroup$
1
-
$\begingroup$ Beyond the obvious -- unambiguous grammars, standard parsing algorithm for context-sensitive grammars -- what are you looking for? $\endgroup$– Raphael ♦Mar 13, 2018 at 12:48
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
Actually, I found something close enough to what I want. They're unambiguous boolean grammars and they're both unambiguous and strictly more powerful than context-free grammars. Other people may find this useful, so I decided to share it.