Return-Path: Message-Id: From: cowan (John Cowan) Subject: BNF - YACC equivalence To: lojban-list Date: Tue, 16 Apr 91 11:43:20 EDT In-Reply-To: <9104120058.AA00298@loop.UUCP>; from "Don Taylor" at Apr 11, 91 5:58 pm X-Mailer: ELM [version 2.2 PL13] Status: RO X-From-Space-Date: Tue Apr 16 11:44:00 1991 X-From-Space-Address: cowan Don Taylor writes: > Is there any thought towards mechanically checking equivalence between the yacc > grammar and this grammar? I THINK it might be possible to build a tree for > both and check the trees for equivalence. That would go a LONG way towards > giving confidence that the two grammars are equivalent. Feel free. I did a bit of simplification as far as eliminating unnecessary rules, so such a system would have to be able to do the same. Things like "a & b & c & d" involve a LOT of YACC rules to capture all the possibilities. -- cowan@snark.thyrsus.com ...!uunet!cbmvax!snark!cowan e'osai ko sarji la lojban