0 views collected around this technical thread.
This article explains step by step how Python creates a function object, builds a call stack, handles parameters, executes the body, performs garbage collection, and manages recursion, illustrating each stage with clear code examples and diagrams.
This article thoroughly explains low‑level function call implementation, covering Intel and AT&T assembly syntax, the evolution of CPU registers from 16‑bit to 64‑bit x86, caller‑ and callee‑saved conventions, stack‑based to register‑based parameter passing, stack frame setup, and assembly representations of control structures.
This article explains how function calls are implemented using a stack‑based memory model, describing stack frames, the role of base and stack pointer registers, and the assembly instructions that create and dismantle these frames during program execution.
This article explains the JVM's stack‑frame structure, local variable tables, operand stacks, dynamic linking, and method return addresses, then demonstrates method call execution with sample Java code and bytecode, and analyzes how the JVM resolves overloaded and overridden methods through static and dynamic dispatch.
This article explains a Java interview puzzle by analyzing how the JVM stack frame handles variable assignments and increment operators, step‑by‑step showing the effects of i = i++, i = ++i, and a complex expression i + ++i * i++ on variable values.
This article explains how Java's post‑ and pre‑increment operators affect variable values by tracing each statement through the JVM's stack frame, local variable table, and operand stack, and demonstrates the resulting values of i, j, and k with detailed diagrams and code examples.
This article explains the concept of tail call optimization in Objective‑C, illustrates correct and incorrect tail‑call examples, describes how the compiler reuses stack frames to achieve O(1) space complexity, and demonstrates the optimization with visual demos and practical code.