Well this is far beyond what the OP wanted!Why do you think so? he mention call stack:
but to a higher point up the call stack.Your code is a bit cheat - you implemented another subroutine, just to remember point in the stack. In my code, during executiom, there was just one "longjump" always to same point, so you had to implement just one subroutine with one label. But in general case you need N goto lables (N is unknown at compilation stage), so it's impossible without eval EXPR (not eval BLOCK)
use strict; use warnings; use Return::MultiLevel qw/with_return/; our %returns; sub rec { my ($i) = @_; $i++; print ">> i=$i\n"; if ($i <= 9) { with_return { $returns{$i} = shift; rec($i); }; } if (@ARGV) { my $r = shift @ARGV; print "RESTORE $r\n"; $returns{$r}->(); } print "<< i=$i\n"; } rec(0); __END__
$perl ml_a.pl 6 >> i=2 >> i=3 >> i=4 >> i=5 >> i=6 >> i=7 >> i=8 >> i=9 >> i=10 RESTORE 6 << i=6 << i=5 << i=4 << i=3 << i=2 << i=1
$perl ml_a.pl 3 >> i=1 >> i=2 >> i=3 >> i=4 >> i=5 >> i=6 >> i=7 >> i=8 >> i=9 >> i=10 RESTORE 3 << i=3 << i=2 << i=1
And let's consider @ARGV as external input, which is available only just before program go to 'RESTORE' point, but not before program started a recursion
In reply to Re^10: Continuations in Perl - Returning to an arbitrary level up the call stack
by vsespb
in thread Continuations in Perl - Returning to an arbitrary level up the call stack
by unlinker
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |