> Possible non-alphabetic characters number around 200 FSVO "alphabet"
Charles -----Original Message----- From: IBM Mainframe Assembler List [mailto:[email protected]] On Behalf Of Robin Vowels Sent: Thursday, June 14, 2018 10:13 PM To: [email protected] Subject: Re: Count Words? From: "Paul Gilmartin" <[email protected]> Sent: Friday, June 15, 2018 5:18 AM > Is there a modern, clever, efficient way to count words in a string where: > o A separator is <TAB> or <SP> (+ others ad lib.) > o A word is a maximal non-empty sequence of consecutive non-separator characters. > (Whew!) > Do TRT and CLI remain the best primitives? (TRT is reported to > perform badly, perhaps model-dependent.) Possible non-alphabetic characters number around 200. One way to simplify seaching (if not using TRT for the search) is to use TRT to replace all non-alphabetic charaters with a blank (say), prior to searching. Still, TRT remains the simplest way to address counting words. --- This email has been checked for viruses by Avast antivirus software. https://www.avast.com/antivirus
