Forums before death by AOL, social media and spammers... "We can't have nice things"
| comp.compilers | Compiler construction, theory, etc. (Mod | 2,753 messages |
[ << oldest | < older | list | newer > | newest >> ]
| Message 2,093 of 2,753 |
| Borneq to All |
| How detect cycle in grammar ? |
| 20 Nov 11 08:48:47 |
From: a.moderacja@gmail.com A->B B->B This grammar is not correct, B is looped. A->B B->C C->A This another grammar, cycle can be arbitrarily long. Is cycle when First(Nonterminal) not contain any terminal, even not epsilon? A->B B-> (=B->epsilon) in first A and B is epsilon --- SoupGate-Win32 v1.05 * Origin: you cannot sedate... all the things you hate (1:229/2) |
(c) 1994, bbs@darkrealms.ca