Re: languages

This seems to be incorrect. I hope this is not ur homework. Here's
another hint.

Try starting with this production. This generates the language
L={a^(2n): n >= 0}

S->aSa | lambda

.

Relevant Pages

  • Re: languages
    ... S-> aBa ... which is not in the language. ... The problem is the production B->S, so drop this and change the ...
    (comp.theory)
  • Re: languages
    ... Try starting with this production. ... This generates the language ... S->aSa | lambda ... So from this I know the langage is equal number of a's. ...
    (comp.theory)
  • Re: Good Environment for Data Modeling R&D
    ... more recent dot Net code + a RDBMS + some SAS stuff too. ... At the end of the day, if it all works well in production, then the IT ... you can just improve the working relationship somewhat, management will ... CL is a very powerful language and while it is easy ...
    (comp.lang.lisp)
  • Re: map/filter/reduce/lambda opinions and background unscientific mini-survey
    ... Python language, while "function" etc are not, but they are certainly ... Just as exposure to functional languages would make lambda very familiar. ... > a letter of the greek alphabet. ... There is nothing about the word "string" that especially brings to mind ...
    (comp.lang.python)
  • Re: Minimal keywords needed for constructing a full CL system
    ... whole universe using lambda ... Remember we're not talking about creating a new language here, ... rather than dumping an image you compile an executable, ... That probably helps a tree shaker very little. ...
    (comp.lang.lisp)