From: "Mauricio Fern�ndez" <batsman.geo@...>
Date: 2002-09-26T21:21:56+09:00
Subject: Is Ruby's grammar LL(k)?


...or better yet LL(1)? Can a recursive descent parser work with all of
Ruby's grammar?

Last time I checked, "The Parrot Guys"(tm :) were attempting to parse
Ruby with Parse::RecDescent... Can it possibly work? Doesn't Ruby need
the full power of yacc's LALR(1)?

-- 
 _           _                             
| |__   __ _| |_ ___ _ __ ___   __ _ _ __  
| '_ \ / _` | __/ __| '_ ` _ \ / _` | '_ \ 
| |_) | (_| | |_\__ \ | | | | | (_| | | | |
|_.__/ \__,_|\__|___/_| |_| |_|\__,_|_| |_|
	Running Debian GNU/Linux Sid (unstable)
batsman dot geo at yahoo dot com
  
Yes I have a Machintosh, please don't scream at me.
	-- Larry Blumette on linux-kernel