';
84 | },
85 | /* onSelect callback fires when a search suggestion is chosen */
86 | onSelect: function(e, term, item) {
87 | console.log(item.getAttribute('data-val'));
88 | location.href = item.getAttribute('data-uri');
89 | }
90 | });
91 | });
--------------------------------------------------------------------------------
/_support/templates/latex/main.mustache:
--------------------------------------------------------------------------------
1 | % -*- mode: latex; -*- mustache tags: {{=« »=}} «! the '&' below prevents HTML escaping. »
2 | \documentclass[10pt,twoside,english]{_support/latex/sbabook/sbabook}
3 | \let\wholebook=\relax
4 |
5 | \usepackage{import}
6 | \subimport{_support/latex/}{common.tex}
7 |
8 | %=================================================================
9 | % Debug packages for page layout and overfull lines
10 | % Remove the showtrims document option before printing
11 | \ifshowtrims
12 | \usepackage{showframe}
13 | \usepackage[color=magenta,width=5mm]{_support/latex/overcolored}
14 | \fi
15 |
16 |
17 | % =================================================================
18 | \title{«& title»}
19 | \author{«& attribution»}
20 | \series{«& series»}
21 |
22 | \hypersetup{
23 | pdftitle = {«& title»},
24 | pdfauthor = {«& attribution»},
25 | pdfkeywords = {«& keywords»}
26 | }
27 |
28 |
29 | % =================================================================
30 | \begin{document}
31 |
32 | % Title page and colophon on verso
33 | \maketitle
34 | \pagestyle{titlingpage}
35 | \thispagestyle{titlingpage} % \pagestyle does not work on the first one…
36 |
37 | \cleartoverso
38 | {\small
39 |
40 | Copyright 2017 by «& attribution».
41 |
42 | The contents of this book are protected under the Creative Commons
43 | Attribution-ShareAlike 3.0 Unported license.
44 |
45 | You are \textbf{free}:
46 | \begin{itemize}
47 | \item to \textbf{Share}: to copy, distribute and transmit the work,
48 | \item to \textbf{Remix}: to adapt the work,
49 | \end{itemize}
50 |
51 | Under the following conditions:
52 | \begin{description}
53 | \item[Attribution.] You must attribute the work in the manner specified by the
54 | author or licensor (but not in any way that suggests that they endorse you
55 | or your use of the work).
56 | \item[Share Alike.] If you alter, transform, or build upon this work, you may
57 | distribute the resulting work only under the same, similar or a compatible
58 | license.
59 | \end{description}
60 |
61 | For any reuse or distribution, you must make clear to others the
62 | license terms of this work. The best way to do this is with a link to
63 | this web page: \\
64 | \url{http://creativecommons.org/licenses/by-sa/3.0/}
65 |
66 | Any of the above conditions can be waived if you get permission from
67 | the copyright holder. Nothing in this license impairs or restricts the
68 | author's moral rights.
69 |
70 | \begin{center}
71 | \includegraphics[width=0.2\textwidth]{_support/latex/sbabook/CreativeCommons-BY-SA.pdf}
72 | \end{center}
73 |
74 | Your fair dealing and other rights are in no way affected by the
75 | above. This is a human-readable summary of the Legal Code (the full
76 | license): \\
77 | \url{http://creativecommons.org/licenses/by-sa/3.0/legalcode}
78 |
79 | \vfill
80 |
81 | % Publication info would go here (publisher, ISBN, cover design…)
82 | Layout and typography based on the \textcode{sbabook} \LaTeX{} class by Damien
83 | Pollet.
84 | }
85 |
86 |
87 | \frontmatter
88 | \pagestyle{plain}
89 |
90 | \tableofcontents*
91 | \clearpage\listoffigures
92 |
93 | \mainmatter
94 |
95 | «& content»
96 |
97 | % lulu requires an empty page at the end. That's why I'm using
98 | % \backmatter here.
99 | \backmatter
100 |
101 | % Index would go here
102 |
103 | \end{document}
104 |
--------------------------------------------------------------------------------
/_support/templates/html/main.mustache:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | {{site_name}}
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 | {{{# attribution}}}{{{/ attribution}}}
19 |
20 |
21 |
22 |
74 |
75 | {{{content}}}
76 |
77 |
78 |
79 |
80 |
81 |
89 |
90 |
91 |
92 |
93 |
94 |
95 |
96 |
97 |
98 |
99 |
100 |
101 |
--------------------------------------------------------------------------------
/_support/latex/sbabook/ci/install-texlive:
--------------------------------------------------------------------------------
1 | #!/bin/bash
2 | set -euo pipefail
3 | trap 's=$?; echo "$0: Error on line "$LINENO": $BASH_COMMAND"; exit $s' ERR
4 | IFS=$'\n\t'
5 | # preamble from https://disconnected.systems/blog/another-bash-strict-mode/
6 |
7 | : "${TEXLIVE_TARBALL:=install-tl-unx.tar.gz}"
8 |
9 | function die() {
10 | echo "$@" >&2
11 | exit 1
12 | }
13 |
14 | function texlive-repo() {
15 | [[ $# -eq 1 ]] || die "${FUNCNAME[0]}: No release specified (YYYY or rolling)"
16 | local release="$1" url
17 |
18 | if [[ "$release" = rolling ]]; then
19 | url='http://mirror.ctan.org/systems/texlive/tlnet'
20 | else
21 | [[ "$release" = [0-9][0-9][0-9][0-9] ]] || die "${FUNCNAME[0]}: incorrect release '$release'"
22 | url="https://ftp.tu-chemnitz.de/pub/tug/historic/systems/texlive/${release}/tlnet-final/"
23 | # the rolling release is missing the shasum, and the tlnet directory
24 | # US mirror: http://ftp.math.utah.edu/pub/tex/historic/systems/texlive/${release}/
25 | fi
26 |
27 | # resolve possible mirror to fixed URL
28 | curl -LIs -o /dev/null -w '%{url_effective}' "$url"
29 | }
30 |
31 | function get-texlive-installer() {
32 | [[ $# -eq 1 ]] || die "Usage: ${FUNCNAME[0]} texlive-repo-url"
33 | local repo="$1"
34 |
35 | # download, checksum, extract
36 | curl --silent --location --remote-name-all "${repo}/${TEXLIVE_TARBALL}"{,.sha512}
37 | sha512sum --check "${TEXLIVE_TARBALL}.sha512"
38 | tar --extract --gzip --file "${TEXLIVE_TARBALL}"
39 | }
40 |
41 | function texlive-profile() {
42 | cat <> texlive.profile
88 | "$installer" --repository "$repo" --profile texlive.profile
89 | tlmgr option repository "$repo"
90 |
91 | tlmgr update --self --all
92 | tlmgr install latex-bin latexmk
93 | }
94 |
95 | # Only call the main function if this script was called as a command. This makes
96 | # it possible to source this script as a library.
97 | if [[ ${BASH_SOURCE[0]} == "$0" ]]; then
98 | # Override the full repository URL or set TEXLIVE_RELEASE to pick that year's frozen release.
99 | # Defaults to the current rolling release.
100 | release="${1:-${TEXLIVE_RELEASE:-rolling}}"
101 | repo="${2:-${TEXLIVE_REPOSITORY:-$(texlive-repo "$release")}}"
102 |
103 | install-texlive "$release" "$repo"
104 | fi
105 |
--------------------------------------------------------------------------------
/_support/html/js/html5shiv-printshiv.min.js:
--------------------------------------------------------------------------------
1 | /**
2 | * @preserve HTML5 Shiv prev3.7.1 | @afarkas @jdalton @jon_neal @rem | MIT/GPL2 Licensed
3 | */
4 | !function(a,b){function c(a,b){var c=a.createElement("p"),d=a.getElementsByTagName("head")[0]||a.documentElement;return c.innerHTML="x",d.insertBefore(c.lastChild,d.firstChild)}function d(){var a=x.elements;return"string"==typeof a?a.split(" "):a}function e(a){var b=w[a[u]];return b||(b={},v++,a[u]=v,w[v]=b),b}function f(a,c,d){if(c||(c=b),p)return c.createElement(a);d||(d=e(c));var f;return f=d.cache[a]?d.cache[a].cloneNode():t.test(a)?(d.cache[a]=d.createElem(a)).cloneNode():d.createElem(a),!f.canHaveChildren||s.test(a)||f.tagUrn?f:d.frag.appendChild(f)}function g(a,c){if(a||(a=b),p)return a.createDocumentFragment();c=c||e(a);for(var f=c.frag.cloneNode(),g=0,h=d(),i=h.length;i>g;g++)f.createElement(h[g]);return f}function h(a,b){b.cache||(b.cache={},b.createElem=a.createElement,b.createFrag=a.createDocumentFragment,b.frag=b.createFrag()),a.createElement=function(c){return x.shivMethods?f(c,a,b):b.createElem(c)},a.createDocumentFragment=Function("h,f","return function(){var n=f.cloneNode(),c=n.createElement;h.shivMethods&&("+d().join().replace(/[\w\-:]+/g,function(a){return b.createElem(a),b.frag.createElement(a),'c("'+a+'")'})+");return n}")(x,b.frag)}function i(a){a||(a=b);var d=e(a);return!x.shivCSS||o||d.hasCSS||(d.hasCSS=!!c(a,"article,aside,dialog,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}mark{background:#FF0;color:#000}template{display:none}")),p||h(a,d),a}function j(a){for(var b,c=a.getElementsByTagName("*"),e=c.length,f=RegExp("^(?:"+d().join("|")+")$","i"),g=[];e--;)b=c[e],f.test(b.nodeName)&&g.push(b.applyElement(k(b)));return g}function k(a){for(var b,c=a.attributes,d=c.length,e=a.ownerDocument.createElement(z+":"+a.nodeName);d--;)b=c[d],b.specified&&e.setAttribute(b.nodeName,b.nodeValue);return e.style.cssText=a.style.cssText,e}function l(a){for(var b,c=a.split("{"),e=c.length,f=RegExp("(^|[\\s,>+~])("+d().join("|")+")(?=[[\\s,>+~#.:]|$)","gi"),g="$1"+z+"\\:$2";e--;)b=c[e]=c[e].split("}"),b[b.length-1]=b[b.length-1].replace(f,g),c[e]=b.join("}");return c.join("{")}function m(a){for(var b=a.length;b--;)a[b].removeNode()}function n(a){function b(){clearTimeout(g._removeSheetTimer),d&&d.removeNode(!0),d=null}var d,f,g=e(a),h=a.namespaces,i=a.parentWindow;return!A||a.printShived?a:("undefined"==typeof h[z]&&h.add(z),i.attachEvent("onbeforeprint",function(){b();for(var e,g,h,i=a.styleSheets,k=[],m=i.length,n=Array(m);m--;)n[m]=i[m];for(;h=n.pop();)if(!h.disabled&&y.test(h.media)){try{e=h.imports,g=e.length}catch(o){g=0}for(m=0;g>m;m++)n.push(e[m]);try{k.push(h.cssText)}catch(o){}}k=l(k.reverse().join("")),f=j(a),d=c(a,k)}),i.attachEvent("onafterprint",function(){m(f),clearTimeout(g._removeSheetTimer),g._removeSheetTimer=setTimeout(b,500)}),a.printShived=!0,a)}var o,p,q="3.7.0",r=a.html5||{},s=/^<|^(?:button|map|select|textarea|object|iframe|option|optgroup)$/i,t=/^(?:a|b|code|div|fieldset|h1|h2|h3|h4|h5|h6|i|label|li|ol|p|q|span|strong|style|table|tbody|td|th|tr|ul)$/i,u="_html5shiv",v=0,w={};!function(){try{var a=b.createElement("a");a.innerHTML="",o="hidden"in a,p=1==a.childNodes.length||function(){b.createElement("a");var a=b.createDocumentFragment();return"undefined"==typeof a.cloneNode||"undefined"==typeof a.createDocumentFragment||"undefined"==typeof a.createElement}()}catch(c){o=!0,p=!0}}();var x={elements:r.elements||"abbr article aside audio bdi canvas data datalist details dialog figcaption figure footer header hgroup main mark meter nav output picture progress section summary template time video",version:q,shivCSS:r.shivCSS!==!1,supportsUnknownElements:p,shivMethods:r.shivMethods!==!1,type:"default",shivDocument:i,createElement:f,createDocumentFragment:g};a.html5=x,i(b);var y=/^$|\b(?:all|print)\b/,z="html5shiv",A=!p&&function(){var c=b.documentElement;return!("undefined"==typeof b.namespaces||"undefined"==typeof b.parentWindow||"undefined"==typeof c.applyElement||"undefined"==typeof c.removeNode||"undefined"==typeof a.attachEvent)}();x.type+=" print",x.shivPrint=n,n(b)}(this,document);
--------------------------------------------------------------------------------
/_support/latex/overcolored.sty:
--------------------------------------------------------------------------------
1 | %%
2 | %% This is file `overcolored.sty',
3 | %% generated with the docstrip utility.
4 | %%
5 | %% The original source files were:
6 | %%
7 | %% overcolored.dtx (with options: `package')
8 | %%
9 | %% This is a generated file.
10 | %%
11 | %% Copyright (C) 2011-2012 by Raphaël Pinson
12 | %% --------------------------------------------------------------------------
13 | %% This work may be distributed and/or modified under the
14 | %% conditions of the LaTeX Project Public License, either version 1.3
15 | %% of this license or (at your option) any later version.
16 | %% The latest version of this license is in
17 | %% http://www.latex-project.org/lppl.txt
18 | %% and version 1.3 or later is part of all distributions of LaTeX
19 | %% version 2005/12/01 or later.
20 | %%
21 | \NeedsTeXFormat{LaTeX2e}[1999/12/01]
22 | \ProvidesPackage{overcolored}
23 | [2011/09/15 0.1 Typeset colored overfull rules]
24 | \ProvidesPackage{overcolored}
25 | \RequirePackage{xcolor}
26 | \RequirePackage{kvoptions}
27 | \RequirePackage{ifluatex}
28 | \SetupKeyvalOptions{
29 | family=overcolored,
30 | prefix=overcolored@,
31 | }
32 | \DeclareStringOption[magenta]{color}
33 | \DeclareStringOption[0.5em]{width}
34 | \DeclareStringOption[3ex]{height}
35 | \ProcessKeyvalOptions*
36 | \def\overcoloredboxtex{%
37 | \hbox to\wd0{%
38 | \setbox0=\hbox to\wd0{\unhbox0}%
39 | \unhbox0 \ifnum\badness>10000 \smash{%
40 | \rlap{\color{\overcolored@color}{%
41 | \rule{\overcolored@width}{\overcolored@height}}}}%
42 | \fi%
43 | }%
44 | }
45 | \def\overuncoloredtex{%
46 | \let\output=\orioutput
47 | }
48 | \ifluatex
49 | \RequirePackage{luatexbase,luacode}
50 | \overfullrule \overcolored@width
51 | \begin{luacode}
52 | magentabox = function(head)
53 | while head do
54 | if head.id == 0 or head.id == 1 then
55 | -- go through the hlists (the rows)
56 | magentabox(head.head)
57 |
58 | -- if there's a rule after the rightskip, this is the overfull box
59 | -- node id 10 == glue, glue subtype 9 is rightskip, node id 2 is a rule
60 |
61 | elseif head.id == 10 and head.subtype == 9 and head.next and head.next.id == 2 then
62 | -- this must be an overfull box
63 | local w1, w2
64 | w1 = node.new("whatsit","pdf_literal")
65 | w1.data = "q 1 0 1 rg"
66 | w1.mode = 1
67 | w2 = node.new("whatsit","pdf_literal")
68 | w2.data = " Q"
69 | w2.mode = 1
70 |
71 | w1.next = head.next -- the rule
72 | head.next = w1 -- color start
73 | w1.next.next = w2 -- color end
74 |
75 | node.slide(head) -- adjust prev pointers
76 | end
77 | head = head.next
78 | end
79 | return true
80 | end
81 | luatexbase.add_to_callback("post_linebreak_filter",magentabox,"magentabox")
82 | \end{luacode}
83 | \else
84 | \interlinepenalty=-50000 % force the break between each two lines
85 | \maxdeadcycles=50 % allow upto 50 \outputs with no \shipout
86 | \newtoks\orioutput \orioutput=\output % wrap the original \output routine
87 | \output
88 | {\ifnum\outputpenalty>-20000 \the\orioutput
89 | \else \ifnum\outputpenalty<-\maxdimen \the\orioutput
90 | \else
91 | \unvbox255 % flush the entire list back
92 | \setbox0=\lastbox % strip the very last box
93 | \nointerlineskip % avoid doubled interline glue
94 | \overcoloredboxtex % make the test and return the box back.
95 | \advance\outputpenalty by50000
96 | \penalty\outputpenalty % weak lie that nothing happened...
97 | \fi\fi}
98 | \fi
99 | \def\overuncolored{%
100 | \ifluatex
101 | \PackageError{overuncolored is not implemented for LuaTeX}
102 | \else
103 | \overuncoloredtex
104 | \fi
105 | }
106 | \endinput
107 | %%
108 | %% End of file `overcolored.sty'.
109 |
--------------------------------------------------------------------------------
/Chapters/Smacc/SmaccTransformationsNotes.txt:
--------------------------------------------------------------------------------
1 | Here are some otes to be turned into text
2 |
3 | I met a woman that told me that she used ANTLR3 to do node transfromation in a declarative way (may be like Smacc). My internet connection is bad so I could not check.
4 | Now she told that what was really important for her was the possibility to add extra nodes during the transformation
5 | because she decorates the tree.
6 | Do you have this kind of support for adding information that is not “from the language”?
7 |
8 | There are a few things you can do:
9 |
10 | 1) You can add a new class to the AST hierarchy by using the %hierarchy directive in the grammar. For example, you can add an OptimizedExpression as a subclass of Expression by doing this:
11 |
12 | %hierarchy Expression ( OptimizedExpression );
13 |
14 | 2) You can add variables to your AST node classes by using the %attributes directive. For example, you can add a variable “value" to your OptimizedExpression:
15 |
16 | %attributes OptimizedExpression ( value );
17 |
18 | 3) You can add dummy productions in the grammar that create variables. For example, we can create an “items" variable in the AdditionExpression node and have it initialized to a new OrderedCollection:
19 |
20 | AdditionExpression : AdditionExpression ‘left’ “+” ‘op’ MultiplicationExpression ‘right’ OrderedCollectionProduction ‘items’ {{}};
21 | OrderedCollectionProduction : {OrderedCollection new};
22 |
23 | 4) If you want dynamically add properties, you can use the #attributeNamed:{ifAbsent:/ifAbsentPut:/put:} methods. When parsing a string, we add the source to the root node using the attributeNamed:put: method.
24 |
25 | 5) You can define a class in the browser and use it. We could even use nodes from different parsers in the same tree — after all, it’s Smalltalk :). Of course, it might be difficult to make a visitor for the combined AST.
26 |
27 |
28 |
29 | Second answer
30 |
31 | Can you also add a node that is not in the grammar (I guess yes) but in the rewrite expression
32 |
33 | a <<< + >>> b <<<
34 | =>
35 | DecoratedNode { + >>>a<<< >>>b<<<<}
36 |
37 |
38 | SmaCC’s default rewriting is different than almost everyone else’s. Instead of rewriting the AST (which is then pretty printed back to source), it actually rewrites the original source. While the search expressions are AST nodes with patterns, the replace expressions are like macro strings with patterns.
39 |
40 | Here are the advantages that I see with SmaCC’s approach:
41 |
42 | *) It can be used to write plain text or things that don’t have AST. I’ve used it to create reports and csv files.
43 |
44 | *) It is good for incremental development of language transformations. We don’t need to have the whole transformation of language A to language B working — we can build it a little at a time. I believe that some get around this problem by having a generic AST that all languages use. This generic AST would then be pretty printed to the different languages.
45 |
46 | *) The transformed source looks more like the original source since we didn’t have to run it through a pretty printer. For example, if they have extra blank lines between two statements, we will retain those blank lines. Some of the AST rewriters store the whitespace tokens so that they can format better, but not all do, and it requires some extra work to keep this information.
47 |
48 | *) It is easy to mix pattern transformations with code that edits the source. There are methods to insert, delete, replace, and move text around. For example, I can rewrite “`a` + `a`” using either a pattern expression “`a` * 2” or by executing some code: “self replace: match right with: ‘2’”. Sometimes the imperative code is easier to understand than the patterns.
49 |
50 | *) SmaCC tracks which rules made each edit. This is especially useful for debugging the rules. I can select some text in the before or after source panes, and it lists all rules that affected the selection. I think this should be possible in the AST rewriters, but I don’t know of any that show this information so I’m guessing that it harder to do.
51 |
52 | A couple drawbacks are:
53 |
54 | *) You may need to parse things multiple times. For example, with an AST rewriter, you can transform the AST multiple times before you pretty print it. In practice, we normally make three parses. The first one creates a bunch of symbol table files that can be loaded on demand later. The second parse does most of the actual work of the conversion (reading the source language and writing the target). The final parse is a code cleanup. The code cleanup might not be necessary, but often it can make the conversion a little easier to perform. For my current PowerBuilder to C# project, I can do all three parses in ~4 minutes. The original code has ~4000 files and it generates >3 million lines of C# so I don’t think 4 minutes is too bad.
55 |
56 | *) If you have multiple source and target languages, you can get the n^2 effect where you need to write the converter for each source/target combination. The AST rewriters that don’t have this problem are the ones with the generic AST nodes.
57 |
58 |
59 |
--------------------------------------------------------------------------------
/_support/html/highlightjs/README.ru.md:
--------------------------------------------------------------------------------
1 | # Highlight.js
2 |
3 | Highlight.js — это инструмент для подсветки синтаксиса, написанный на JavaScript. Он работает
4 | и в браузере, и на сервере. Он работает с практически любой HTML разметкой, не
5 | зависит от каких-либо фреймворков и умеет автоматически определять язык.
6 |
7 |
8 | ## Начало работы
9 |
10 | Минимум, что нужно сделать для использования highlight.js на веб-странице — это
11 | подключить библиотеку, CSS-стили и вызывать [`initHighlightingOnLoad`][1]:
12 |
13 | ```html
14 |
15 |
16 |
17 | ```
18 |
19 | Библиотека найдёт и раскрасит код внутри тегов `
`, попытавшись
20 | автоматически определить язык. Когда автоопределение не срабатывает, можно явно
21 | указать язык в атрибуте class:
22 |
23 | ```html
24 |
...
25 | ```
26 |
27 | Список поддерживаемых классов языков доступен в [справочнике по классам][2].
28 | Класс также можно предварить префиксами `language-` или `lang-`.
29 |
30 | Чтобы отключить подсветку для какого-то блока, используйте класс `nohighlight`:
31 |
32 | ```html
33 |
...
34 | ```
35 |
36 | ## Инициализация вручную
37 |
38 | Чтобы иметь чуть больше контроля за инициализацией подсветки, вы можете
39 | использовать функции [`highlightBlock`][3] и [`configure`][4]. Таким образом
40 | можно управлять тем, *что* и *когда* подсвечивать.
41 |
42 | Вот пример инициализации, эквивалентной вызову [`initHighlightingOnLoad`][1], но
43 | с использованием jQuery:
44 |
45 | ```javascript
46 | $(document).ready(function() {
47 | $('pre code').each(function(i, block) {
48 | hljs.highlightBlock(block);
49 | });
50 | });
51 | ```
52 |
53 | Вы можете использовать любые теги разметки вместо `
`. Если
54 | используете контейнер, не сохраняющий переводы строк, вам нужно сказать
55 | highlight.js использовать для них тег ` `:
56 |
57 | ```javascript
58 | hljs.configure({useBR: true});
59 |
60 | $('div.code').each(function(i, block) {
61 | hljs.highlightBlock(block);
62 | });
63 | ```
64 |
65 | Другие опции можно найти в документации функции [`configure`][4].
66 |
67 |
68 | ## Web Workers
69 |
70 | Подсветку можно запустить внутри web worker'а, чтобы окно
71 | браузера не подтормаживало при работе с большими кусками кода.
72 |
73 | В основном скрипте:
74 |
75 | ```javascript
76 | addEventListener('load', function() {
77 | var code = document.querySelector('#code');
78 | var worker = new Worker('worker.js');
79 | worker.onmessage = function(event) { code.innerHTML = event.data; }
80 | worker.postMessage(code.textContent);
81 | })
82 | ```
83 |
84 | В worker.js:
85 |
86 | ```javascript
87 | onmessage = function(event) {
88 | importScripts('/highlight.pack.js');
89 | var result = self.hljs.highlightAuto(event.data);
90 | postMessage(result.value);
91 | }
92 | ```
93 |
94 |
95 | ## Установка библиотеки
96 |
97 | Highlight.js можно использовать в браузере прямо с CDN хостинга или скачать
98 | индивидуальную сборку, а также установив модуль на сервере. На
99 | [странице загрузки][5] подробно описаны все варианты.
100 |
101 | **Не подключайте GitHub напрямую.** Библиотека не предназначена для
102 | использования в виде исходного кода, а требует отдельной сборки. Если вам не
103 | подходит ни один из готовых вариантов, читайте [документацию по сборке][6].
104 |
105 | **Файл на CDN содержит не все языки.** Иначе он будет слишком большого размера.
106 | Если нужного вам языка нет в [категории "Common"][5], можно дообавить его
107 | вручную:
108 |
109 | ```html
110 |
111 | ```
112 |
113 | **Про Almond.** Нужно задать имя модуля в оптимизаторе, например:
114 |
115 | ```
116 | r.js -o name=hljs paths.hljs=/path/to/highlight out=highlight.js
117 | ```
118 |
119 |
120 | ## Лицензия
121 |
122 | Highlight.js распространяется под лицензией BSD. Подробнее читайте файл
123 | [LICENSE][7].
124 |
125 |
126 | ## Ссылки
127 |
128 | Официальный сайт билиотеки расположен по адресу .
129 |
130 | Более подробная документация по API и другим темам расположена на
131 | .
132 |
133 | Авторы и контрибьюторы перечислены в файле [AUTHORS.ru.txt][8] file.
134 |
135 | [1]: http://highlightjs.readthedocs.io/en/latest/api.html#inithighlightingonload
136 | [2]: http://highlightjs.readthedocs.io/en/latest/css-classes-reference.html
137 | [3]: http://highlightjs.readthedocs.io/en/latest/api.html#highlightblock-block
138 | [4]: http://highlightjs.readthedocs.io/en/latest/api.html#configure-options
139 | [5]: https://highlightjs.org/download/
140 | [6]: http://highlightjs.readthedocs.io/en/latest/building-testing.html
141 | [7]: https://github.com/isagalaev/highlight.js/blob/master/LICENSE
142 | [8]: https://github.com/isagalaev/highlight.js/blob/master/AUTHORS.ru.txt
143 |
--------------------------------------------------------------------------------
/Chapters/Smacc/SmaccVocabulary.md:
--------------------------------------------------------------------------------
1 | ## Vocabulary
2 |
3 |
4 | This chapter defines some vocabulary used by Smacc.
5 |
6 |
7 | ### Reference Example
8 |
9 |
10 | Let us take the following grammar.
11 |
12 | ```
13 | : [0-9]+ (\. [0-9]*) ? ;
14 | : \s+;
15 |
16 | %left "+" "-";
17 | %left "*" "/";
18 | %right "^";
19 | %annotate_tokens;
20 | %root Expression;
21 | %prefix AST;
22 | %suffix Node;
23 |
24 | Expression
25 | : Expression 'left' "+" 'operator' Expression 'right' {{Binary}}
26 | | Expression 'left' "-" 'operator' Expression 'right' {{Binary}}
27 | | Expression 'left' "*" 'operator' Expression 'right' {{Binary}}
28 | | Expression 'left' "/" 'operator' Expression 'right' {{Binary}}
29 | | Expression 'left' "^" 'operator' Expression 'right' {{Binary}}
30 | | "(" Expression ")" {{}}
31 | | Number
32 | ;
33 | Number
34 | : {{Number}}
35 | ;
36 | ```
37 |
38 |
39 |
40 | ### Metagrammar structure
41 |
42 |
43 | SmaCC grammars are written in EBNF format \(Extended Backus-Naur Form\) with a syntax resembling closely to the one of GNU Bison.
44 | A grammar is composed of:
45 |
46 | - Scanner rules: they define tokens to recognize in the input stream through regex,
47 | - Parser rules: they define the production rules of your grammar,
48 | - Directives: they are additional information for the parsing or for the AST generation.
49 |
50 |
51 | Note that you can also find the metagrammar of SmaCC described in itself in the `SmaCCDefinitionParser`.
52 |
53 |
54 | ### Elements
55 |
56 |
57 |
58 | #### Production rule
59 |
60 |
61 | The following expressions define two production rules.
62 |
63 | ```
64 | Expression
65 | : Expression 'left' "+" 'operator' Expression 'right' {{Binary}}
66 | | Expression 'left' "-" 'operator' Expression 'right' {{Binary}}
67 | ;
68 |
69 | Number
70 | : {{Number}}
71 | ;
72 | ```
73 |
74 |
75 | A production rule is defined by a left-hand side and several alternatives.
76 | - Here the first production rule has two alternatives.
77 | - While the second production rule has only one.
78 |
79 |
80 | An alternative can be composed of any variation of:
81 | - non-terminals often start with uppercase
82 | - scanner tokens
83 | - keywords \(delimited by `"`\)
84 |
85 |
86 | In addition, you can use the single curly braces `{}` to define an arbitrary semantic action or the double curly braces `{{}}` to create an AST node instead.
87 | Non terminals and tokens can be annotated with variable names \(delimited by `'`\) which will be the instance variable names of the AST node.
88 |
89 |
90 | #### Tokens
91 |
92 |
93 | Tokens are identified by the scanner.
94 | A token specification is composed of a token name and a token regular expression.
95 |
96 | ```
97 | : RegularExpression ;
98 | ```
99 |
100 |
101 | The following token specification describes a number.
102 | It starts with one or more digits, possibly followed by a decimal point with zero or more digits after it.
103 | The scanner definition for this token is:
104 |
105 | ```
106 | : [0-9]+ (\. [0-9]*) ? ;
107 | ```
108 |
109 |
110 | Let's go over each part:
111 |
112 |
113 |
114 | ``
115 | Names the token identified by the expression. The name inside the <> must be a legal Pharo variable name.
116 |
117 | `:`
118 | Separates the name of the token from the token's definition.
119 |
120 | `[0-9]`
121 | Matches any single character in the range `'0'` to `'9'` \(a digit\). We could also use `\d` or `` as these also match digits.
122 |
123 | `+`
124 | Matches the previous expression one or more times. In this case, we are matching one or more digits.
125 |
126 | `( ... )`
127 | Groups subexpressions. In this case, we are grouping the decimal point and the numbers following the decimal point.
128 |
129 | `\.`
130 | Matches the '.' character \(. has a special meaning in regular expressions, quotes it\).
131 |
132 | `*`
133 | Matches the previous expression zero or more times.
134 |
135 | `?`
136 | Matches the previous expression zero or one time \(i.e., it is optional\).
137 |
138 | `;`
139 | Terminates a token specification.
140 |
141 |
142 | #### Keywords
143 |
144 |
145 | Keywords are defined in the production and delimited by `"`.
146 | Keywords are only defined through static strings, regular expressions cannot be used.
147 | In the following example, `"+"` and `"-"` are considered keywords.
148 |
149 | ```
150 | Expression
151 | : Expression 'left' "+" 'operator' Expression 'right' {{Binary}}
152 | | Expression 'left' "-" 'operator' Expression 'right' {{Binary}}
153 | ;
154 | ```
155 |
156 |
157 |
158 | #### Non Terminal
159 |
160 |
161 | In the production rule `Expression 'left' "+" 'operator' Expression 'right'`, Expression is a non-terminal.
162 |
163 |
164 | #### Variables
165 |
166 |
167 | Variables give name to one element of a production.
168 | For example
169 |
170 | ```
171 | Expression 'left' "^" 'operator' Expression 'right'
172 | ```
173 |
174 |
175 | - 'left' and 'right' denote the first and second expressions of the alternative.
176 | - 'operator' denotes the caret token.
177 |
178 |
--------------------------------------------------------------------------------