Article View: comp.lang.modula2
Article #1233CASE structures
From: Brian M McNamara
Date: Tue, 09 Oct 1990 06:22
Date: Tue, 09 Oct 1990 06:22
8 lines
967 bytes
967 bytes
I am using the latest FST compiler. I was attempting to write a program that developed random strings of characters that resembled English by using some ocurence sampling tables from a text book. What I ended up with was a case construct with 26 possibilities but the range f possibilities was from 1 to 10000. After ten minutes the compiler had not completed the second pass. Can anyone tell me where to look for a possible solution? Brian
Technical Details
Message-ID:
<39707@eerie.acsu.Buffalo.EDU>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!know!zaphod.mps.ohio-state.edu!ub!ubvmsd.cc.buffalo.edu!v056ped5Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!know!zaphod.mps.ohio-state.edu!ub!ubvmsd.cc.buffalo.edu!v056ped5 From: v056ped5@ubvmsd.cc.buffalo.edu (Brian M McNamara) Newsgroups: comp.lang.modula2 Subject: CASE structures Message-ID: <39707@eerie.acsu.Buffalo.EDU> Date: 9 Oct 90 06:22:03 GMT Sender: news@acsu.Buffalo.EDU Reply-To: v056ped5@ubvmsd.cc.buffalo.edu Organization: University at Buffalo Lines: 8 Nntp-Posting-Host: ubvmsd.cc.buffalo.edu News-Software: VAX/VMS VNEWS 1.3-4.3