Thread: Programming an automata using context free grammar

  1. #1
    Registered User
    Join Date
    Aug 2004

    Programming an automata using context free grammar

    Hi, I m looking for programming an automata that must remove empty derivaions from a text chain given, I would like to know if anoyone has programmed this that would give me a hint on how does this is done, or a good internet link about programming this steps,
    -removing ambiguity
    -removing recursion
    -removing emty derivations
    -removing unitary productions
    -passing to chomskey form

    I really would like something like an internet site with examples about how to program it, I am thinking about a recursive function, however, I am a bit lost

    Thanx for your time

  2. #2
    Devil's Advocate SlyMaelstrom's Avatar
    Join Date
    May 2004
    Out of scope
    Well, I guess I'll kick off the discussion with asking what you've done so far. It's how we operate here.
    Sent from my iPadŽ

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. free() doesn't seem to work...
    By AlienJedi in forum C Programming
    Replies: 10
    Last Post: 01-29-2008, 05:27 PM
  2. Free Store of memory
    By George2 in forum C++ Programming
    Replies: 6
    Last Post: 11-12-2007, 02:27 PM
  3. OpenGL -- Bitmaps
    By HQSneaker in forum Game Programming
    Replies: 14
    Last Post: 09-06-2004, 04:04 PM
  4. free() and struct
    By DrakkenKorin in forum C Programming
    Replies: 2
    Last Post: 11-28-2001, 09:24 PM
  5. Free MIT courses via web.
    By Justin W in forum A Brief History of
    Replies: 4
    Last Post: 11-15-2001, 09:41 PM