CFG for L(G) and L(G')
- From: "jason_box" <cppisfun@xxxxxxxxx>
- Date: 22 Feb 2006 19:53:52 -0800
Given a CFG G where epsilon is in L(G), how would you create a new
grammar L(G' = L(G) - epsilon? I know there is a method that allows you
to change a grammar G where epsilon is not part of L(G) and you can get
a equivalent grammar G' having no epsilon production. The question
arises when you have epislon as part of the lanaguage. Thank you for
help in adanced.
.
- Follow-Ups:
- Re: CFG for L(G) and L(G')
- From: Torben Ægidius Mogensen
- Re: CFG for L(G) and L(G')
- Prev by Date: Any randomized algorithm for solving the 2-D bin-packing problem?
- Next by Date: Call for Papers: IAENG International Workshop on Operations Research (of IMECS 2006)
- Previous by thread: Any randomized algorithm for solving the 2-D bin-packing problem?
- Next by thread: Re: CFG for L(G) and L(G')
- Index(es):
Relevant Pages
|