Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
仮想マシンにおけるスタックの管理
Search
monochrome
July 11, 2021
Programming
250
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
仮想マシンにおけるスタックの管理
言語処理系Slackミートアップ#4(2021/07/11)
monochrome
July 11, 2021
More Decks by monochrome
See All by monochrome
RubyKaigi2026: Invariants in my own Ruby
sisshiki1969
0
29
Improving my own Ruby thereafter
sisshiki1969
1
260
あなたとJIT, 今すぐアセンブ ル
sisshiki1969
1
1.1k
Improve my own Ruby
sisshiki1969
1
610
My own Ruby, thereafter
sisshiki1969
0
430
Running Optcarrot (faster) on my own Ruby.
sisshiki1969
1
340
Rustでゴミ集め
sisshiki1969
1
390
RustでつくるRubyのFiber
sisshiki1969
0
340
Shinjuku.rs#15 Rustでつくるx86アセンブラ
sisshiki1969
0
1.8k
Other Decks in Programming
See All in Programming
kubernetes コンポーネント開発入門 / 新卒N年目の勉強会&交流会!〜〇〇への誘い〜 #n_study
mazrean
0
240
マイコン向けの軽量Ruby「PicoRuby」で各種デバイスを制御するネイティブアプリの実現手法
bash0c7
0
410
From 6 People Classroom Meetup to 100 People Regional Conference / FOSS4G Hiroshima 2026
furukawayasuto
0
200
AI × TiDD / 2026.09.05 Redmine 大阪
tokudiro
1
170
AIを上手に使っていこうとしたら越境せざるを得なくなった話 〜実践1年で見えた境界を越えなければならない理由と進め方〜 / Crossing borders with AI
tomoyakitaura
4
1.2k
SREの越境 / SRE Collaboration
y0hgi
0
190
大喜利で理解するLLM as a Judge / Understanding LLM-as-a-Judge through Ogiri
rockname
0
110
モデルのリファクタリングが難しいと思ったら、そもそも複雑だったのはビジネス仕様だった ? / is-the-business-domain-the-real-complexity
hatsu38
0
270
WebMCP Challenge に星空観察アプリで参加した話
okajun35
0
170
{ Android | Kotlin } Gradle Plugin in 2026
ryunen344
1
320
変化を抱擁するドキュメントの作り方 - ビジネスルール駆動開発がもたらす、コードとの新しい関係
ioki
2
200
AHC070解法紹介
eijirou
0
120
Featured
See All Featured
Abbi's Birthday
coloredviolet
4
10k
Accessibility Awareness
sabderemane
1
210
What Being in a Rock Band Can Teach Us About Real World SEO
427marketing
0
1.1k
State of Search Keynote: SEO is Dead Long Live SEO
ryanjones
0
280
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
52
6.1k
Facilitating Awesome Meetings
lara
57
7.1k
How to Think Like a Performance Engineer
csswizardry
28
2.8k
From π to Pie charts
rasagy
1
370
Easily Structure & Communicate Ideas using Wireframe
afnizarnur
194
17k
Avoiding the “Bad Training, Faster” Trap in the Age of AI
tmiket
0
240
How to audit for AI Accessibility on your Front & Back End
davetheseo
0
540
Designing for humans not robots
tammielis
254
26k
Transcript
プログラミング言語Slack 定期ミートアップ 2021/07/11 仮想マシンにおけるスタック・ヒープのハンドリング monochrome ruruby: https://github.com/sisshiki1969/ruruby
def g end def f g() end f() toplevel Virtual
Context stack
def g end def f g() end f() toplevel f
Virtual Context stack
def g end def f g() end f() toplevel f
g Virtual Context stack
def g end def f g() end f() toplevel f
Virtual Context stack
def g end def f g() end f() toplevel Virtual
Context stack
t = 100 3.times do b1 = 0 end toplevel
block Virtual Context stack b1 t
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel f Virtual Context stack f1
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel f Virtual Context stack f1 block b1 Heap space
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel f Virtual Context stack block b1 Heap space f’ f1
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel Virtual Context stack block b1 Heap space f’ f1 p
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel Virtual Context stack block b1 Heap space f’ f1 p
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel Virtual Context stack block b1 Heap space f’ f1 p g
def f f1 = 5 Proc.new do b1 = 1
g() end end p = f() p.call() toplevel Virtual Context stack block b1 Heap space f’ f1 p