Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. When programming was (still) fun

When programming was (still) fun

Scheduled Pinned Locked Moved The Lounge
15 Posts 10 Posters 232 Views
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • raddevusR Offline
    raddevusR Offline
    raddevus
    wrote last edited by
    #6

    I really enjoy hearing other people's stories about how they got into the IT jobs. Yours is a really great one.
    I remember those MSDN CDs too. Lots of fun to be had. 😄

    and, you're right, the fact that "tech is everywhere" now has really dampened the enjoyment.
    It was great when you went to your computer and worked on it and then forgot about it as you headed out to real life.
    Smart Phones and the consequences they've created are what has really made the world quite terrible. But I'm sure 🚫🚫 AI 🚫🚫 and ⛔⛔brain embedded⛔⛔ technology will set everything right. 😣

    1 Reply Last reply
    1
    • honey the codewitchH Offline
      honey the codewitchH Offline
      honey the codewitch
      wrote last edited by
      #7

      image.png

      1 Reply Last reply
      1
      • CPalliniC Offline
        CPalliniC Offline
        CPallini
        wrote last edited by
        #8

        Writing games for the ZX Spectrum using Basic and Z80 assembly, was fun, back in the eighties.

        In testa che avete, signor di Ceprano?

        1 Reply Last reply
        1
        • theoldfoolT Offline
          theoldfoolT Offline
          theoldfool
          wrote last edited by
          #9

          I think it was more satisfying (avoiding the word fun) because the technology was newer and the tools were crude. I started as a jet engine mechanic. Later, my first "system" had vacuum tubes, relays, and core storage. then we graduated to trouble shooting using bit switch programs we wrote. The "good old days" were not as good as today, which will be somebody's "good old days".

          1 Reply Last reply
          1
          • Mircea NeacsuM Offline
            Mircea NeacsuM Offline
            Mircea Neacsu
            wrote last edited by
            #10

            I got hooked to computers in mid ‘70s, at the end of the era of punch cards and program listings on accordion paper. At the start of the first semester in CS, I meet a friend from high school, a year older and also in CS who says:
            “I have a nice little problem for you. Write a program to find all the ways you can position 8 queens on a chessboard so that they don’t attack each other.”
            The only game in town at the time was FORTRAN, and there is no recursion in FORTRAN, and this was my first program so, obviously it didn’t work. Cocky, like most 18 years old are, I said to myself “sure it’s compiler’s fault, my logic is impeccable” so I started to look at the assembler code generated by compiler. The only problem was that I didn’t knew assembler, so I started to learn assembler. Now I couldn’t understand how the compiler knew what code to generate, so I started to learn about context-free grammars, LL(1) and LR(1) parsers, and so on. Never finished the stupid program, but by the end of my adventure, I was thoroughly hooked. And still am.

            OriginalGriffO Richard Andrew x64R 2 Replies Last reply
            2
            • Mircea NeacsuM Mircea Neacsu

              I got hooked to computers in mid ‘70s, at the end of the era of punch cards and program listings on accordion paper. At the start of the first semester in CS, I meet a friend from high school, a year older and also in CS who says:
              “I have a nice little problem for you. Write a program to find all the ways you can position 8 queens on a chessboard so that they don’t attack each other.”
              The only game in town at the time was FORTRAN, and there is no recursion in FORTRAN, and this was my first program so, obviously it didn’t work. Cocky, like most 18 years old are, I said to myself “sure it’s compiler’s fault, my logic is impeccable” so I started to look at the assembler code generated by compiler. The only problem was that I didn’t knew assembler, so I started to learn assembler. Now I couldn’t understand how the compiler knew what code to generate, so I started to learn about context-free grammars, LL(1) and LR(1) parsers, and so on. Never finished the stupid program, but by the end of my adventure, I was thoroughly hooked. And still am.

              OriginalGriffO Offline
              OriginalGriffO Offline
              OriginalGriff
              wrote last edited by
              #11

              @Mircea-Neacsu said in When programming was (still) fun:

              there is no recursion in FORTRAN

              Well, not before FORTRAN 90 anyway, and the only compiler I remember that actually checked for it was GNU g77. The others "took it as read" that it wasn't going to happen and let you do what you wanted (which was pretty much the ground state for anything in FORTRAN code!*). I used to simulate it by implementing my own stack instead of using local variables, and it worked fine (if slowly).

              • Remember, you could declare a variable as a single integer and than use it as a 10 dimensional array of floting point values if you felt the need: COMMON was a handy keyword if you wanted to modify your OS from your app ...

              "I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
              "Common sense is so rare these days, it should be classified as a super power" - Random T-shirt

              1 Reply Last reply
              0
              • T Offline
                T Offline
                trønderen
                wrote last edited by
                #12

                The Fortran I used in 1978 did allow recursion. Neither compiler nor machine was mainstream, but a proprietary 16-bit mini. Its developers were more or less "fresh from school", they had learnt the academics of compilers for languages like Algol, Simula etc. and, I was told, never learned to handle function calls without a stack. So handling recursion came at no extra expense. They didn't know how to prevent it. :-)

                I do believe that the first BASIC I used in 1975, on a Univac 1110 mainfram, allowed recursion - but the manual is buried so deep down in the basement that I will not spend the time to verify it.

                1 Reply Last reply
                0
                • Mircea NeacsuM Mircea Neacsu

                  I got hooked to computers in mid ‘70s, at the end of the era of punch cards and program listings on accordion paper. At the start of the first semester in CS, I meet a friend from high school, a year older and also in CS who says:
                  “I have a nice little problem for you. Write a program to find all the ways you can position 8 queens on a chessboard so that they don’t attack each other.”
                  The only game in town at the time was FORTRAN, and there is no recursion in FORTRAN, and this was my first program so, obviously it didn’t work. Cocky, like most 18 years old are, I said to myself “sure it’s compiler’s fault, my logic is impeccable” so I started to look at the assembler code generated by compiler. The only problem was that I didn’t knew assembler, so I started to learn assembler. Now I couldn’t understand how the compiler knew what code to generate, so I started to learn about context-free grammars, LL(1) and LR(1) parsers, and so on. Never finished the stupid program, but by the end of my adventure, I was thoroughly hooked. And still am.

                  Richard Andrew x64R Offline
                  Richard Andrew x64R Offline
                  Richard Andrew x64
                  wrote last edited by
                  #13

                  @Mircea-Neacsu How did FORTRAN enforce the no recursion rule? How could it detect recursion even when indirect?

                  1 Reply Last reply
                  0
                  • T Offline
                    T Offline
                    trønderen
                    wrote last edited by
                    #14

                    Every Fortran function could have a flag indicating 'busy', to be reset upon return. It could be the return address: Zero it upon return, and if it is non-zero upon entry, then you have made a recursive call.

                    If you want to know at compile/link time: A flow analysis tool could follow all possible flow paths, graymarking every function on the current path being analyzed. If extending the path by one more call, and it hits a graymarked entry, then you have a direct or indirect recursion.

                    I don't know what old (pre '90) compilers did; these are jutst my thoughts about how it could be done. I suspect that a lot of implementations simply said: Oh, so the program crashed? Well, you broke the rules, it is your own fault!

                    1 Reply Last reply
                    0
                    • FreedMallocF Offline
                      FreedMallocF Offline
                      FreedMalloc
                      wrote last edited by
                      #15

                      I took a programming course in BASIC as a senior in highschool. I really enjoyed it and discovered I was pretty good at it (at least compared to most of my fellow students). My class instructor said a 4 year degree was the best path to make it my career (this was in 1975). Best advice I ever followed. 4 years later I was a FORTRAN and Assembler programmer for UNIVAC, moved to C and then C++ on UNIX workstations and ended in C++ and C# on Windows PCs when I retired in 2017. Fun times indeed.

                      1 Reply Last reply
                      1
                      Reply
                      • Reply as topic
                      Log in to reply
                      • Oldest to Newest
                      • Newest to Oldest
                      • Most Votes


                      • Login

                      • Don't have an account? Register

                      • Login or register to search.
                      • First post
                        Last post
                      0
                      • Categories
                      • Recent
                      • Tags
                      • Popular
                      • World
                      • Users
                      • Groups