regular expressions, word matching

Hi,

I want to count words in a string which are NOT with length 10. For me
word is a sequence of symbols different from ' '. So I want to match
these words. I think that the pattern has to be something like that "[^
]{10}|[ ]" but with not somewhere.
How to set to match not this pattern? Or other ideas?

Thanks.

.

Relevant Pages

  • Re: Example of verilog-a serial bit source.
    ... sequence source suitable for transient simulation. ... The Pattern parameters specify the sequence of the four states. ... This is the bit string, which is a series of the four states, 1 0 m z. ... repeats from the specified bit to the end of the bit string. ...
    (comp.cad.cadence)
  • Re: Example of verilog-a serial bit source.
    ... sequence source suitable for transient simulation. ... The Pattern parameters specify the sequence of the four states. ... This is the bit string, which is a series of the four states, 1 0 m z. ... repeats from the specified bit to the end of the bit string. ...
    (comp.cad.cadence)
  • Re: Primes: Randomness and Prime Twin Proof
    ... increasingly random sequence of 1's and 0's true. ... Let's try to define this pattern. ... with which you can set the probability of a 1 occuring. ... position and wrote them down to produce a new string of 1's and 0's. ...
    (sci.math)
  • Re: Time Calculation
    ... create a string yourself, such as: ... The pattern should be obvious so you can make it as complex as you ... Rob ... Prev by Date: ...
    (microsoft.public.excel.worksheet.functions)
  • Re: Work Rota - Do I need a formula?
    ... I guess I'm a little confused because I thought a pattern with ...3, ... > Dana DeLouis Wrote: ... >> increasing sequence. ... Prev by Date: ...
    (microsoft.public.excel.misc)