Re: Context Free language, the language empty string (lambda)

On Mon, 30 Apr 2007 16:03:16 +0200, cyberbloke <cyberbloke@xxxxxxxxx> wrote:

Which context free language corresponds to the language empty string
(lambda):

S-->aS
S-->empty string

or
S-->aS

or
S-->empty string

or all of the above. Can you explain if possible, trying to
understand the concept.

If you can't answer that question, then you *seriously* need to at least read your lesson about grammar before asking someone else to do your homework.

Maybe you should start by trying to "run" the grammar and see what you get. You'll probably have most of the answer to your questions in a time no bigger than the one needed to send your message on comp.theory *and* you'll really learn something in the process.

In the case of this question, whatever I could see to explain the answer is most certainly present in the textbook or in the lecture on the subject from which the exercice is taken. This is direct application of the definitions.

--
Hypocoristiquement,
Jym.
.

Relevant Pages

  • Re: need simple parsing ability
    ... > sometimes a short string followed by an integer, ... Here's a pyparsing solution. ... then to the parse actions attached to the ... different bits of the grammar. ...
    (comp.lang.python)
  • Re: design a Condition class
    ... of grammars in pyparsing. ... # parse input string ... The resulting grammar expressions are fairly readable. ... by another word group of alphabetic characters, ...
    (comp.lang.python)
  • Re: An argument for the redundancy of truth
    ... settle where I suggested, it ought to settle - as the grammar of ... If you KNEW what a grammar was, THEN YOU WOULD KNOW this already, ... The purpose of a grammar is to define some structure on a string. ... AND EVERY GRAMMAR DETERMINES those truth-values. ...
    (sci.logic)
  • Re: Definition of Production
    ... rule to input string, ... `production' == `production rule'. ... Grammar productions are defined formally in Waite & Goos, ... of finite V strings, including the empty string). ...
    (comp.compilers)
  • Whats This Model of Computing Called?
    ... It's something that takes a sequence of symbols (a character string) as input, makes some faint whirring sounds for a while, and hopefully gives a sequence of symbols as output when it halts. ... But, in general, whatever it is, it can be described by an attributed grammar. ... But here's the idea I had: use this model of computing to compute the attribute strings themselves! ... Such strings, along with literal strings, can then be concatenated into one string, which may itself be processed by a parser specified by a nonterminal symbol. ...
    (comp.theory)