WSR5672@TNTECH.BITNET (06/07/89)
Can anyone tell me where I could find a LL(1) grammar of modula-2??
Thanks,
Scott Redmon
Tennessee Tech. University
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-fransvo@maestro.htsa.aha.nl (Frans van Otten) (06/07/89)
Scott Redmon writes: >Can anyone tell me where I could find a LL(1) grammar of modula-2?? The syntax of Modula-2 is not easy to convert to LL(1). For example, the designator/qualident problem: designator ::= qualident { '.' identifier | '[' ExpList ']' | '^' }. qualident ::= identifier { '.' identifier }. See the problem ? You will have to do some semantical analysis. Within these restrictions, I have a LL(1) grammar for Modula-2 available. Just mail me. -- Frans van Otten | fransvo@maestro.htsa.aha.nl or Algemene Hogeschool Amsterdam | fransvo@htsa.uucp or Technische en Maritieme Faculteit | [[...!]backbone!]htsa!fransvo
aplusl@ethz.UUCP (Albert Meier) (06/13/89)
In article <INFO-M2%89060620250985@UCF1VM> Modula2 List <INFO-M2%UCF1VM.bitnet@jade.berkeley.edu> writes: >Can anyone tell me where I could find a LL(1) grammar of modula-2?? > Scott Redmon Write to: Universitaet Linz Heinz Dobler Institut fuer Softwaretechnologie Althardstrasse A-4040 Linz-Auhof At this university the scanner and parser generators Alex and Coco have been written by Peter Moessenboeck and Prof. Rechenberg (the book has been recently published by Prentice Hall). Coco and Alex bases on LL(1) technology and I guess that they have what you need. ..... Albert Meier Tel. +41/1/700 30 37 .. .... A+L AG, Im Spaeten 23, CH-8906 Bonstetten .. .... .......A+L. E-Mail aplusl@ifi.ethz.(ch/UUCP) .. ....... ...mcvax!cernvax!ethz!aplusl