Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^3: joining lines efficiency?

by AnomalousMonk (Canon)
on Jun 10, 2013 at 16:16 UTC ( #1038107=note: print w/ replies, xml ) Need Help??

in reply to Re^2: joining lines efficiency?
in thread joining lines efficiency?

The regex also needs to ... ignore "/*" ie should the characters be quoted.

It should also handle stuff like this, which compiles and runs just fine:

#include <stdio.h> #include <assert.h> void main (int argc, char ** argv) { int x = 4; int y = 2; int * p = &y; assert(x/*p == 12345 /* p points to y */); printf("everything looks just fine \n"); }

Comment on Re^3: joining lines efficiency?
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1038107]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (7)
As of 2015-11-27 09:24 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (722 votes), past polls