7.4.2 Performance Limitations

List-Based Stack - Push/Pop: O(1) ✓ - SP-relative access: O(n) ✗ - Impact: Slow for deep stacks (>1000 elements)

String Operations - ‘AFFS’ creates intermediate structures - Linear in string length (acceptable)