Code Generation/Example 1: Revision history

14 May 2021

• curprev 06:5806:58, 14 May 2021 Root talk contribs 1,926 bytes +116 →Postfix Code

6 May 2020

• curprev 22:2622:26, 6 May 2020 Root talk contribs 1,810 bytes −24 →Postfix Code

12 February 2019

• curprev 11:3111:31, 12 February 2019 Root talk contribs 1,834 bytes +36 No edit summary

1 May 2018

• curprev 22:2222:22, 1 May 2018 Root talk contribs 1,798 bytes +11 →Postfix Code

9 May 2017

• curprev 07:2607:26, 9 May 2017 Root talk contribs 1,787 bytes +33 →Postfix Code

7 May 2015

• curprev 18:2718:27, 7 May 2015 Root talk contribs 1,754 bytes +1 →Postfix Code

6 April 2015

• curprev 14:2914:29, 6 April 2015 Root talk contribs 1,753 bytes +1 No edit summary

28 May 2009

• curprev 21:5521:55, 28 May 2009 Root talk contribs 1,752 bytes +27 →Postfix Code

25 May 2009

• curprev 07:2607:26, 25 May 2009 Root talk contribs 1,725 bytes +55 →Postfix Code
• curprev 07:2607:26, 25 May 2009 Root talk contribs 1,670 bytes −14 →The Original Code
• curprev 07:2507:25, 25 May 2009 Root talk contribs 1,684 bytes +6 No edit summary
• curprev 07:2407:24, 25 May 2009 Root talk contribs 1,678 bytes +1,678 New page: == The Problem == Translate into Postfix the following C function. <c> int main() { int n = 45, i = 0, j = 1, *seg = &i; while (n-- > 0) { print(*seg = i + j); seg = (seg == &...