home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!spool.mu.edu!agate!darkstar.UCSC.EDU!ra.UCSC.EDU!sutin
- From: sutin@ra.UCSC.EDU (Brian Sutin)
- Newsgroups: rec.games.pbm
- Subject: Re: Galaxy Results Format
- Date: 22 Dec 1992 21:35:08 GMT
- Organization: Lick Observatory UCSC
- Lines: 23
- Message-ID: <1h81mcINNmcu@darkstar.UCSC.EDU>
- References: <1h781gINNil8@fbi-news.Informatik.Uni-Dortmund.DE>
- NNTP-Posting-Host: ra.ucsc.edu
- Keywords: galaxy
-
- In article <1h781gINNil8@fbi-news.Informatik.Uni-Dortmund.DE> markhof@ls12r.informatik.uni-dortmund.de (Ingolf Markhof) writes:
-
- >Anyway, I'd like to have a small change in the galaxy rules to support
- >parsing. This change of rules is related to the rules of names in Galaxy.
- >It would be _very_ nice to restrict the allowed names in Galaxy: All names
- >should be identifiers in the sense of programing languages, i.e. they should
- >be forced to start with a letter. Moreover, any Galaxy keywords form the
- >section headings should be reserved, i.e. "Status of Players" yields three
- >keywords: Status, of, Players.
-
- Why? Lex could handle state dependent keywords the last time I used it.
-
- I have a parser which chews down the complete output, and then decides
- where all my cargo ships go, makes maps, designs ships, assigns production,
- etc. It is 700 lines of c code. I used the advanced lexical analyzer
- named "scanf," which is perfectly suited for the task. Give it a try.
-
- Before anyone asks, if you want a program like this, write your own.
-
- Brian Sutin sutin@lick.ucsc.edu
- Lick Observatory, UCSC Santa Cruz, CA 95064
- Fred: "May I rescue you?"
- Ginger: "No, thank you. I prefer being in distress."
-