Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only not deleted user 917

Questions about ambiguity in context-free grammars.

0 votes

Is there a name/interest for regular languages that have a non-ambiguous ending?

Are you merely looking for unicity of the last character? In that case, you may mean a property such as: the regular expression ends with a character (it is xc for some expression x and character c …
reinierpost's user avatar
  • 5,951
6 votes

How to prove that a grammar is unambiguous?

This is a good question, but some Googling would have told you that there is no general method for deciding ambiguity, so you need to make your question more specific. …
reinierpost's user avatar
  • 5,951
0 votes
Accepted

Discard all ambiguity from given CFG

The difference: a grammar is unambiguous if you never have ambiguity left after parsing has completed; it is deterministic if you never have ambiguity during parsing, and we have different forms of it …
reinierpost's user avatar
  • 5,951