Re: [Groff] condition: OR of two string comparisons

[Steffen Nurpmeso]

Hello again, and however..

i wrote
 |Ralph Corderoy <address@hidden> wrote:
 ||Exactly.  Taking an earlier suggestion for OR, it's valid now.

which makes the former a backward-compatibility no-go, even though
i don't want to imagine a case where it would cause a problem.
But anyway, i wonder what you all think about instead introducing

  .if $'a'b'c'd'e'f'g'a'$ .tm matches

i.e., by enclosing the expression in a pair of dollars the normal
delimiters can be used all through the case..esac string
comparison series.
It is always hairy using a dollar, but most normal letters are
taken and groff has so many special cases for character usage that
i'll take a long time to dig into this.  And another one is needed
for regular expression matching.

 |I have no idea, but the attached patch should do this pretty well.
 |Note i'm running groff(1) with my [file_case] extension and
 |without GNULib, but it applies somewhat:

Same is true, but it is a standalone patch, not "on-top".

 |I'm not sure i like this approach, though.

I would like this approach much more.

 |Ciao,

--steffen

hohe72.diff
Description: Text Data