Re^4: Minimizing the amount of place holders on long identical regex

Thank you for your time and effort reading my question. I have wrote it on my question:

I could use potentially split the string character by character and store the output in an array. Where from there I would remove the even elements and reform the array into string with join. But in my case this is not possible as the system that I am writing the regex does not support the split function or join it only supports C format commands syntax, so I am using Perl as a test tool before implementation.

The environment that I want to apply the regex is written in C language and only follows C syntax solutions, but since Perl is also written in C language any solution in Perl works also for the system. So I am using Perl as test bed to find a more elegant solution than mine.

I hope now it is more clear. :)

BR / Thanos

Seeking for Perl wisdom...on the process of learning...not there...yet!

Comment on Re^4: Minimizing the amount of place holders on long identical regex Select or Download Code

Replies are listed 'Best First'.
Re^5: Minimizing the amount of place holders on long identical regex by ikegami (Patriarch) on Jun 20, 2018 at 17:20 UTC
`char even_chars(const char src) { char dst = malloc(strlen(src)/2 + 1); char p = dst; while (1) { if (!src) break; (p++) = (src++); if (!src) break; src++; } *p = 0; return dst; }` [download]	[reply] [d/l]