Date: Thu, 17 Feb 2000 01:03:02 -0800 From: W Gerald Hicks <jhix@mindspring.com> To: jcm@dogma.freebsd-uk.eu.org Cc: freebsd-questions@FreeBSD.ORG Subject: Re: parser question Message-ID: <20000217010302L.jhix@mindspring.com> In-Reply-To: <Pine.BSF.4.21.0002161722030.80162-100000@dogma.freebsd-uk.eu.org> References: <Pine.BSF.4.21.0002161722030.80162-100000@dogma.freebsd-uk.eu.org>
next in thread | previous in thread | raw e-mail | index | archive | help
From: Jonathon McKitrick <jcm@dogma.freebsd-uk.eu.org> Subject: parser question Date: Wed, 16 Feb 2000 17:26:31 +0000 (GMT) > 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?? > Hrm. 1) Learn Yacc/Lex. It is the Unix way. 2) Get the dragon-book(s) by Aho/Ullman 3) Read "The Unix Programming Environment" by Brian Kernighan and Rob Pike. Cheers, Jerry Hicks jhix@mindspring.com (who never met a recursive descent parser weenie that knew Yacc :) 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?20000217010302L.jhix>