Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Hans-Peter Diettrich Newsgroups: comp.compilers Subject: Re: Some questions about recursive descent? Date: Wed, 2 Mar 2022 05:52:46 +0100 Organization: Compilers Central Lines: 16 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-03-003@comp.compilers> References: <22-02-021@comp.compilers> <22-02-024@comp.compilers> <22-02-026@comp.compilers> <22-02-027@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="21177"; mail-complaints-to="abuse@iecc.com" Keywords: parse, LL(1) Posted-Date: 02 Mar 2022 09:50:40 EST X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <22-02-027@comp.compilers> Xref: csiph.com comp.compilers:2908 On 3/1/22 2:40 AM, Johann 'Myrkraverk' Oskarsson wrote: > where previous steps are also shown[1].  Then figure 3.14 shows a > predictive parsing table, presumably constructed using the FIRST > and FOLLOW sets. > >           a            c             d >     +-----------------------------------------+ >   X |  X -> a        X -> Y        X -> Y     | >     |  Y -> Y                                 | Just a typo correction: In (X,a) the second alternative should read X -> Y not Y -> Y. DoDi