No the ASN.1 grammar as such (from the ITU-T) is far from LALR(1), but the grammar could be transformed into LALR(1) to a larger extent. If the requirement is strict LALR(1) then it a long process (esp. when dealing with grammar related to Objects, Classes, Parameterization and the notorious Defined Syntax of course). If you are looking for a quicker solution then I can vouch for one option - Generalized LR Parsing.
Regards Ramaswamy R Member Technical Staff HCL Technologies Ltd 184 Arcot Road Vadapalani Chennai - 600026 Ph (Off) : 23728366 ext 2344 The world steps aside for the man who knows where he's going. Disclaimer: This message and any attachment(s) contained here are information that is confidential, proprietary to HCL Technologies and its customers. Contents may be privileged or otherwise protected by law. The information is solely intended for the individual or the entity it is addressed to. If you are not the intended recipient of this message, you are not authorized to read, forward, print, retain, copy or disseminate this message or any part of it. If you have received this e-mail in error, please notify the sender immediately by return e-mail and delete it from your computer. -----Original Message----- From: Buday Gergely [mailto:[EMAIL PROTECTED] Sent: Tuesday, April 27, 2004 2:39 PM To: [EMAIL PROTECTED] Subject: [ASN.1] ASN.1 grammar Could anybody tell me whether the ASN.1 grammar is LALR(1)? - Gergely
