Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.forth > #34725

Re: A useful trick in recursive debugging.

From Paul Rubin <no.email@nospam.invalid>
Newsgroups comp.lang.forth
Subject Re: A useful trick in recursive debugging.
Date 2014-11-30 12:36 -0800
Organization Nightsong/Fort GNOX
Message-ID <7x38901l52.fsf@ruckus.brouhaha.com> (permalink)
References <547b4f72$0$15832$e4fe514c@dreader35.news.xs4all.nl> <7xr3wk8thd.fsf@ruckus.brouhaha.com> <547b784d$0$6971$e4fe514c@dreader36.news.xs4all.nl>

Show all headers | View raw


albert@spenarnc.xs4all.nl (Albert van der Horst) writes:

> In article <7xr3wk8thd.fsf@ruckus.brouhaha.com>,
> Paul Rubin  <no.email@nospam.invalid> wrote:
>>albert@spenarnc.xs4all.nl (Albert van der Horst) writes:
>>>           S[ 3 1 ]
>>>              S[ 4 3 0 ]
>>
>>How do you locate the boundaries between DS frames without
>>pushing/popping DSP on the return stack with every function call?
>
> With a .S at the start and the entry of a recursive call, all
> intermediate stack prints are more indented. So those two line
> up vertically. That is often enough. After all .S is not much
> more than a simple debugging tool.

Oh I see, that output was from a separate call to .S at each level.

Does the .S somehow distinguish between recursive calls and ordinary
calls?  I.e. do you get indentation if you're 4 levels deep in normal,
non-recursive calls?  I suppose it's fine either way.

Back to comp.lang.forth | Previous | Next — Previous in thread | Find similar | Unroll thread


Thread

A useful trick in recursive debugging. albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-11-30 17:10 +0000
  Re: A useful trick in recursive debugging. Paul Rubin <no.email@nospam.invalid> - 2014-11-30 09:54 -0800
    Re: A useful trick in recursive debugging. albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-11-30 20:04 +0000
      Re: A useful trick in recursive debugging. Paul Rubin <no.email@nospam.invalid> - 2014-11-30 12:36 -0800

csiph-web