Re^3: Which is faster ?

I just thought it checks/compares more signs in the case of $flag ne -1

$flag != -1 and $flag ne -1 aren't the same thing. ne is string comparison, and I could well imagine that it's slightly slower (but I really doubt that I'm able to prove that in a benchmark, so don't believe me).

Btw, what does "-MO=Concise" exactlly do ?

It's the same as use B::Concise;, which prints something like a syntax tree for the program. See B::Concise for more information.

Comment on Re^3: Which is faster ? Select or Download Code

Replies are listed 'Best First'.
Re^4: Which is faster ? by thenetfreaker (Friar) on Jun 04, 2008 at 17:34 UTC
I asked about "-MO=Concise" because its output reminded of Assembly so i wandered if there's a way to convert a perl script into an .asm file ? I need it because I'm working on a program that evantually I want to "convert" into a microchip, therefore, I need an asm prototype of my program for some machines in an electronic facility in my town to make a chip out of my "algorythm". So is there a way to convert perl to asm ?	[reply]
Re^5: Which is faster ? by moritz (Cardinal) on Jun 04, 2008 at 17:54 UTC
So is there a way to convert perl to asm ? No, not really. There are few programs that attempt to turn perl into a "real" executable, by linking libperl and the bytecode into a common executable, but I doubt that it works for non-standard CPUs, and some of these attempts, notably perlcc, were already abandoned. Perl does produce an op tree that is comparable to java's byte code (but still very different), but usually it doesn't leave the interpreter.	[reply]