Re: Context Free Grammer

cyberbloke <cyberbloke@xxxxxxxxx> wrote:
The language a*b* a context free grammar ? can you explain if it is or
why not?

Since you described it with a regular expression, it's obviously a
regular language.

--
Chris Smith
.

Relevant Pages

  • Re: Regular expression problem
    ... Chris Smith wrote: ... is that some focus group analysis indicates that when users of a certain application are asked to give examples of valid and invalid strings, the shortest POSIX egrep regular expression seems to correlate well with their own informal description of what they meant to use to validate input. ...
    (comp.theory)
  • Re: Regular Languages
    ... > Is it possible to represent each regular language with a planar NFA graph? ... Every regular language has a regular expression, ...
    (comp.theory)