Date: Wed, 16 Feb 2000 17:26:31 +0000 (GMT) From: Jonathon McKitrick <jcm@dogma.freebsd-uk.eu.org> To: freebsd-questions@freebsd.org Subject: parser question Message-ID: <Pine.BSF.4.21.0002161722030.80162-100000@dogma.freebsd-uk.eu.org>
next in thread | raw e-mail | index | archive | help
Hi all, I have to write a recursive-descent parser for a class assignment. I was reading through the source for gcc, and some of the code is written in yacc, which is developed expressly for parsers and compilers. Is there a simpler way to understand this? My prof just gave me a small BNF grammar, and my prog must parse it and generate errors for any input file that breaks the grammar rules. Does gcc use recursive descent at all? Is there one file in source which is a good example of this, without requiring me to learn YACC/Lex?? -=> jm <=- Please CC me on all replies ------------------------------------------------------- "The light that burns twice as bright burns half as long, and you have burned so very, very brightly." To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-questions" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.4.21.0002161722030.80162-100000>