summaryrefslogtreecommitdiffstats
path: root/articles/page/2/index.html
diff options
context:
space:
mode:
authorLoïc Hoguin <[email protected]>2018-06-13 09:54:12 +0200
committerLoïc Hoguin <[email protected]>2018-06-13 09:54:12 +0200
commit92b54aacc0de5446dd5497c39897b0bbff72e626 (patch)
treec3a98cfec636d1271f5804e5c19b35b208bba00d /articles/page/2/index.html
parent8b5c3dc972b99f174750123c9e4abc96259c34a9 (diff)
downloadninenines.eu-92b54aacc0de5446dd5497c39897b0bbff72e626.tar.gz
ninenines.eu-92b54aacc0de5446dd5497c39897b0bbff72e626.tar.bz2
ninenines.eu-92b54aacc0de5446dd5497c39897b0bbff72e626.zip
Rebuild using Asciideck
Diffstat (limited to 'articles/page/2/index.html')
-rw-r--r--articles/page/2/index.html56
1 files changed, 28 insertions, 28 deletions
diff --git a/articles/page/2/index.html b/articles/page/2/index.html
index 194f9243..c8629fe5 100644
--- a/articles/page/2/index.html
+++ b/articles/page/2/index.html
@@ -75,8 +75,8 @@
</header>
<p>I will now be regularly writing posts about project status, plans and hopes for the future.
- Before that though, there&#8217;s one important news to share.
- Until a year ago all development was financed through consulting and development services. This worked alright but too much time was spent doing things that didn&#8217;t benefit the open source projects. And that didn&#8217;t make me happy at all. Because I like being happy I stopped that for the most part and spent the year figuring things out, experimenting and discussing with people about it.</p>
+Before that though, there&apos;s one important news to share.
+Until a year ago all development was financed through consulting and development services. This worked alright but too much time was spent doing things that didn&apos;t benefit the open source projects. And that didn&apos;t make me happy at all. Because I like being happy I stopped that for the most part and spent the year figuring things out, experimenting and discussing with people about it.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/january-2014-status/">Read More</a>
@@ -92,10 +92,10 @@
</p>
</header>
- <p>This was a triumph! I&#8217;m making a note here: HUGE SUCCESS!!
- It&#8217;s hard to overstate my satisfaction. Thanks to everyone who made this possible.
- If you have backed this fundraiser, and haven&#8217;t provided your personal details yet, please do so quickly so that your rewards can be sent!
- I am hoping that we will be able to make good use of all that money. The details of the expenses will be published regularly on the 2013 Fundraiser wiki page, giving you full disclosure as to how your money is used.</p>
+ <p>This was a triumph! I&apos;m making a note here: HUGE SUCCESS!!
+It&apos;s hard to overstate my satisfaction. Thanks to everyone who made this possible.
+If you have backed this fundraiser, and haven&apos;t provided your personal details yet, please do so quickly so that your rewards can be sent!
+I am hoping that we will be able to make good use of all that money. The details of the expenses will be published regularly on the 2013 Fundraiser wiki page, giving you full disclosure as to how your money is used.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/farwest-funded/">Read More</a>
@@ -111,8 +111,8 @@
</p>
</header>
- <p>Building OTP releases has always been a difficult task. Tools like Reltool or Rebar have made this simpler, but it&#8217;s no panacea. This article will show you an alternative and hopefully much simpler solution.
- There is two steps to building a release. First you need to build the various OTP applications you want to include in the release. Once done, you need to create the release itself, by including the Erlang runtime system alongside the applications, a boot script to start the node and all its applications, and some configuration files.</p>
+ <p>Building OTP releases has always been a difficult task. Tools like Reltool or Rebar have made this simpler, but it&apos;s no panacea. This article will show you an alternative and hopefully much simpler solution.
+There is two steps to building a release. First you need to build the various OTP applications you want to include in the release. Once done, you need to create the release itself, by including the Erlang runtime system alongside the applications, a boot script to start the node and all its applications, and some configuration files.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/erlang.mk-and-relx/">Read More</a>
@@ -128,9 +128,9 @@
</p>
</header>
- <p>Today we will start the work on the intermediate module that will be used to run the code for the expressions found in our file&#8217;s body, replacing our interpreter.
- This is what we want to have when all the work is done:
- xerl -&gt; tokens -&gt; AST -&gt; intermediate -&gt; cerl Today we will perform this work only on the atomic integer expression however, so we will not build any module at the end.</p>
+ <p>Today we will start the work on the intermediate module that will be used to run the code for the expressions found in our file&apos;s body, replacing our interpreter.
+This is what we want to have when all the work is done:
+xerl -&gt; tokens -&gt; AST -&gt; intermediate -&gt; cerl Today we will perform this work only on the atomic integer expression however, so we will not build any module at the end.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/xerl-0.5-intermediate-module/">Read More</a>
@@ -147,9 +147,9 @@
</header>
<p>As promised we are adding an expression separator this time. This will be short and easy.
- In the tokenizer we only need to add a line recognizing the comma as a valid token.
- , : {token, {',', TokenLine}}. Then we need to change the following lines in the parser:
- exprs -&gt; expr : ['$1']. exprs -&gt; expr exprs : ['$1' | '$2']. And add a comma between the expressions on the second line:</p>
+In the tokenizer we only need to add a line recognizing the comma as a valid token.
+, : {token, {',', TokenLine}}. Then we need to change the following lines in the parser:
+exprs -&gt; expr : ['$1']. exprs -&gt; expr exprs : ['$1' | '$2']. And add a comma between the expressions on the second line:</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/xerl-0.4-expression-separator/">Read More</a>
@@ -166,7 +166,7 @@
</header>
<p>I would like to share some experience and theories on Erlang scalability.
- This will be in the form of a series of hints, which may or may not be accompanied with explanations as to why things are this way, or how they improve or reduce the scalability of a system. I will try to do my best to avoid giving falsehoods, even if that means a few things won&#8217;t be explained.</p>
+This will be in the form of a series of hints, which may or may not be accompanied with explanations as to why things are this way, or how they improve or reduce the scalability of a system. I will try to do my best to avoid giving falsehoods, even if that means a few things won&apos;t be explained.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/erlang-scalability/">Read More</a>
@@ -183,8 +183,8 @@
</header>
<p>We will be adding atomic integer expressions to our language. These look as follow in Erlang:
- 42. And the result of this expression is of course 42.
- We will be running this expression at compile time, since we don&#8217;t have the means to run code at runtime yet. This will of course result in no module being compiled, but that&#8217;s OK, it will allow us to discuss a few important things we&#8217;ll have to plan for later on.</p>
+42. And the result of this expression is of course 42.
+We will be running this expression at compile time, since we don&apos;t have the means to run code at runtime yet. This will of course result in no module being compiled, but that&apos;s OK, it will allow us to discuss a few important things we&apos;ll have to plan for later on.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/xerl-0.3-atomic-expressions/">Read More</a>
@@ -201,10 +201,10 @@
</header>
<p>Everything is an expression.
- This sentence carries profound meaning. We will invoke it many times over the course of these articles.
- If everything is an expression, then the language shouldn&#8217;t have any problem with me defining two modules in the same source file.
- mod first_module begin end mod second_module begin end Likewise, it shouldn&#8217;t have any problem with me defining a module inside another module.
- mod out_module begin mod in_module begin end end Of course, in the context of the Erlang VM, these two snippets are equivalent; there is nothing preventing you from calling the in_module module from any other module.</p>
+This sentence carries profound meaning. We will invoke it many times over the course of these articles.
+If everything is an expression, then the language shouldn&apos;t have any problem with me defining two modules in the same source file.
+mod first_module begin end mod second_module begin end Likewise, it shouldn&apos;t have any problem with me defining a module inside another module.
+mod out_module begin mod in_module begin end end Of course, in the context of the Erlang VM, these two snippets are equivalent; there is nothing preventing you from calling the in_module module from any other module.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/xerl-0.2-two-modules/">Read More</a>
@@ -220,9 +220,9 @@
</p>
</header>
- <p>Let&#8217;s build a programming language. I call it Xerl: eXtended ERLang. It&#8217;ll be an occasion for us to learn a few things, especially me.
- Unlike in Erlang, in this language, everything is an expression. This means that modules and functions are expression, and indeed that you can have more than one module per file.
- We are just starting, so let&#8217;s no go ahead of ourselves here. We&#8217;ll begin with writing the code allowing us to compile an empty module.</p>
+ <p>Let&apos;s build a programming language. I call it Xerl: eXtended ERLang. It&apos;ll be an occasion for us to learn a few things, especially me.
+Unlike in Erlang, in this language, everything is an expression. This means that modules and functions are expression, and indeed that you can have more than one module per file.
+We are just starting, so let&apos;s no go ahead of ourselves here. We&apos;ll begin with writing the code allowing us to compile an empty module.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/xerl-0.1-empty-modules/">Read More</a>
@@ -239,7 +239,7 @@
</header>
<p>Last week I was speaking at the London Erlang Factory Lite where I presented a live demonstration of building an FTP server using Ranch. As there was no slide, you should use this article as a reference instead.
- The goal of this article is to showcase how to use Ranch for writing a network protocol implementation, how Ranch gets out of the way to let you write the code that matters, and the common techniques used when writing servers.</p>
+The goal of this article is to showcase how to use Ranch for writing a network protocol implementation, how Ranch gets out of the way to let you write the code that matters, and the common techniques used when writing servers.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/ranch-ftp/">Read More</a>
@@ -256,9 +256,9 @@
</header>
<p>Everyone knows Tic Tac Toe, right?
- Players choose either to be the Xs or the Os, then place their symbol on a 3x3 board one after another, trying to create a line of 3 of them.
- Writing an algorithm to check for victory sounds easy, right? It&#8217;s easily tested, considering there&#8217;s only 8 possible winning rows (3 horizontal, 3 vertical and 2 diagonal).
- In Erlang though, you probably wouldn&#8217;t want an algorithm.</p>
+Players choose either to be the Xs or the Os, then place their symbol on a 3x3 board one after another, trying to create a line of 3 of them.
+Writing an algorithm to check for victory sounds easy, right? It&apos;s easily tested, considering there&apos;s only 8 possible winning rows (3 horizontal, 3 vertical and 2 diagonal).
+In Erlang though, you probably wouldn&apos;t want an algorithm.</p>
<p style="text-align:right">
<a class="read_more" href="https://ninenines.eu/articles/tictactoe/">Read More</a>