The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
7 views
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unambiguous.
asked ago in Theory of Computation by Loyal (7.1k points) | 7 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,070 questions
53,206 answers
184,550 comments
70,420 users