<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Language Design on Phosphor BBS</title>
		<link>https://phosphorbbs.net/tags/language-design/</link>
		<description>Recent content in Language Design on Phosphor BBS</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Sat, 19 Sep 2026 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://phosphorbbs.net/tags/language-design/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Blackjack in Phosphor: A Door Game as a Language Test</title>
				<link>https://phosphorbbs.net/blog/blackjack-in-phosphor-a-door-game-as-a-language-test/</link>
				<pubDate>Sat, 19 Sep 2026 00:00:00 +0000</pubDate>
				<guid>https://phosphorbbs.net/blog/blackjack-in-phosphor-a-door-game-as-a-language-test/</guid>
				<description>&lt;p&gt;Every language looks fine in its own test suite. The tests were written&#xA;by the same people who wrote the language, with the same blind spots.&#xA;The only honest benchmark is a program someone actually wants to run.&lt;/p&gt;&#xA;&lt;p&gt;So when the question came up — &amp;ldquo;would it be easy to create a simple&#xA;blackjack game for the BBS?&amp;rdquo; — the answer was: yes, and that&amp;rsquo;s exactly&#xA;the test Phosphor needs. Blackjack is a sweet spot for a scripting&#xA;language&amp;rsquo;s first real workload. It has genuine state (a shuffled deck,&#xA;two hands, a bankroll), real control flow (a dealer AI that hits to&#xA;17, ace soft/hard counting), string wrangling (card glyphs), user&#xA;input, and persistence. If the parser, the evaluator, and the door&#xA;bridge can carry all of that, the language is real. If they can&amp;rsquo;t, we&#xA;find out where.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
