From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,b52a18baa90247c4,start X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1994-10-03 18:18:20 PST Path: bga.com!news.sprintlink.net!howland.reston.ans.net!agate!msuinfo!harbinger.cc.monash.edu.au!aggedor.rmit.EDU.AU!edna.cc.swin.edu.au!edna!944166 From: 944166@edna.swin.edu.au (Jimmy Fang) Newsgroups: comp.lang.ada Subject: Newbie Generic Reg Exp Pattern Matching Question Date: 3 Oct 1994 14:54:52 GMT Organization: Swinburne University of Technology Message-ID: <36p5vsINNcjt@edna.cc.swin.edu.au> NNTP-Posting-Host: edna.cc.swin.edu.au X-Newsreader: TIN [version 1.2 PL2] Date: 1994-10-03T14:54:52+00:00 List-Id: I'm having trouble getting a generic Regular Expression Matching. This code fragment is taken out of Booch's Software Components book. 23 generic 24 type ITEM is private; 25 type INDEX is (<>); 26 type ITEMS is array (INDEX range <>) of ITEM; 27 Any_Item : in ITEM; 28 Escape_Item : in ITEM; 29 Not_Item : in ITEM; 30 Closure_Item : in ITEM; 31 Start_Class : in ITEM; 32 Stop_Class : in ITEM; 33 with function "=" ( Left : in ITEM; 34 Right : in ITEM) return Boolean; ** *****E equality parameters must be same limited type [LRM 6.7/4] ** 35 Now when I change "type ITEM is private" to "... is limited private", the compiler complains about Any_Items .. Stop_Class "cannot be limited for in mode". I've tried reading the LRM, but am confused by the reference. I've gotten the other matching algorithms to run (debugging some typos out of the book) but like the idea of using wildcards, etc. Thanks for any pointers. - Jim --------------------------------------------------------------------- Under-Gradual Student, Swinburne University of Technology, Australia