Slide 1

Slide 1 text

Parsing, Compiling and Static Metaprogramming Patrick Dubroy Google Munich @dubroy

Slide 2

Slide 2 text

Writing programs that manipulate programs as data Metaprogramming

Slide 3

Slide 3 text

Static Metaprogramming Writing programs that manipulate code

Slide 4

Slide 4 text

COMPILER

Slide 5

Slide 5 text

COMPILER Code Code

Slide 6

Slide 6 text

COMPILER C++ 1011

Slide 7

Slide 7 text

C++ 1011 PARSER CODEGEN Parse Tree

Slide 8

Slide 8 text

Esprima A high-performance JavaScript parser written in JavaScript. Also: estraverse & escodegen

Slide 9

Slide 9 text

var esprima = require('esprima'); esprima.parse(" \ function getAnswer() { \ return 42; \ } \ ");

Slide 10

Slide 10 text

Program FunctionDeclaration Identifier Body ReturnStatement Literal “42”

Slide 11

Slide 11 text

{ "type": "Program", "body": [ { "type": "FunctionDeclaration", "id": { "type": "Identifier", "name": "getAnswer" }, "params": [], "defaults": [], "body": { "type": "BlockStatement", "body": [ { "type": "ReturnStatement", "argument": { "type": "Literal", "value": 42, "raw": "42" } } ] }, } ] }

Slide 12

Slide 12 text

function checkStyle(code, filename) { var ast = esprima.parse(code, parseOptions); var errors = []; estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } }); return formatErrors(code, errors, filename); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); }

Slide 13

Slide 13 text

function checkStyle(code, filename) { var ast = esprima.parse(code, parseOptions); var errors = []; estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } }); return formatErrors(code, errors, filename); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); } var ast = esprima.parse(code, parseOptions);

Slide 14

Slide 14 text

function checkStyle(code, filename) { var ast = esprima.parse(code, parseOptions); var errors = []; estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } }); return formatErrors(code, errors, filename); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); } estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } });

Slide 15

Slide 15 text

function checkStyle(code, filename) { var ast = esprima.parse(code, parseOptions); var errors = []; estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } }); return formatErrors(code, errors, filename); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); }

Slide 16

Slide 16 text

function checkStyle(code, filename) { var ast = esprima.parse(code, parseOptions); var errors = []; estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'VariableDeclaration') checkVariableNames(node, errors); } }); return formatErrors(code, errors, filename); } function checkVariableNames(node, errors) { _.each(node.declarations, function(decl) { if (decl.id.name.indexOf('_') >= 0) { return errors.push({ location: decl.loc, message: 'Use camelCase, not hacker_style!' }); } }); }

Slide 17

Slide 17 text

var foo = bar; var this_is_bad = 3; function blah() { return function x() { var oops_another_one; } }

Slide 18

Slide 18 text

var foo = bar; var this_is_bad = 3; function blah() { return function x() { var oops_another_one; } } [ 'Line 1, column 34: Use camelCase for variable names, not hacker_style.', 'Line 1, column 119: Use camelCase for variable names, not hacker_style.' ]

Slide 19

Slide 19 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); }

Slide 20

Slide 20 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); } var ast = esprima.parse(code);

Slide 21

Slide 21 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); } estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } });

Slide 22

Slide 22 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); }

Slide 23

Slide 23 text

FunctionDeclaration Identifier BlockStatement Statement Statement ... Array .body .body

Slide 24

Slide 24 text

FunctionDeclaration Identifier BlockStatement Statement Statement ... Array .body .body Statement

Slide 25

Slide 25 text

FunctionDeclaration Identifier BlockStatement Statement Statement ... Array .body .body Statement

Slide 26

Slide 26 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); } return escodegen.generate(ast);

Slide 27

Slide 27 text

function addLogging(code) { var ast = esprima.parse(code); estraverse.traverse(ast, { enter: function(node, parent) { if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') { addBeforeCode(node); } } }); return escodegen.generate(ast); } function addBeforeCode(node) { var name = node.id ? node.id.name : ''; var beforeCode = "console.log('Entering " + name + "()');"; var beforeNodes = esprima.parse(beforeCode).body; node.body.body = beforeNodes.concat(node.body.body); }

Slide 28

Slide 28 text

addLogging(" \ function foo(a, b) { \ var x = 'blah'; \ var y = (function () { \ return 3; \ })(); \ } \ foo(1, 'wut', 3); \ ");

Slide 29

Slide 29 text

addLogging(" \ function foo(a, b) { \ var x = 'blah'; \ var y = (function () { \ return 3; \ })(); \ } \ foo(1, 'wut', 3); \ "); function foo(a, b) { console.log('Entering foo()'); var x = 'blah'; var y = function () { console.log('Entering ()'); return 3; }(); } foo(1, 'wut', 3);

Slide 30

Slide 30 text

addLogging(" \ function foo(a, b) { \ var x = 'blah'; \ var y = (function () { \ return 3; \ })(); \ } \ foo(1, 'wut', 3); \ "); function foo(a, b) { console.log('Entering foo()'); var x = 'blah'; var y = function () { console.log('Entering ()'); return 3; }(); } foo(1, 'wut', 3);

Slide 31

Slide 31 text

Parser Generators

Slide 32

Slide 32 text

PARSER GENERATOR Language Grammar Parser

Slide 33

Slide 33 text

No content

Slide 34

Slide 34 text

Formal Grammars

Slide 35

Slide 35 text

expr → expr [-+] term | term term → term [*/] factor | factor factor → '(' expr ')' | number number → [0-9]+ Context-Free Grammar

Slide 36

Slide 36 text

expr ::= expr [-+] term | term term ::= term [*/] factor | factor factor ::= '(' expr ')' | number number ::= [0-9]+ Backus–Naur Form

Slide 37

Slide 37 text

expr = expr [-+] term | term term = term [*/] factor | factor factor = '(' expr ')' | number number = [0-9]+ EBNF

Slide 38

Slide 38 text

expr = expr [-+] term | term term = term [*/] factor | factor factor = '(' expr ')' | number number = [0-9]+ | | | CFG: Unordered choice

Slide 39

Slide 39 text

expr = expr [-+] term / term term = term [*/] factor / factor factor = '(' expr ')' / number number = [0-9]+ / / / PEG: Ordered Choice

Slide 40

Slide 40 text

var PEG = require('pegjs'); var parser = PEG.buildParser(" \ expr = expr [-+] term / term \ term = term [*/] factor / factor \ factor = '(' expr ')' / number \ number = [0-9]+ \ "); parser.parse('1+10');

Slide 41

Slide 41 text

var PEG = require('pegjs'); var parser = PEG.buildParser(" \ expr = expr [-+] term / term \ term = term [*/] factor / factor \ factor = '(' expr ')' / number \ number = [0-9]+ \ "); parser.parse('1+10'); ~/node_modules/pegjs/lib/peg.js:3316 throw new PEG.GrammarError( ^ PEG.GrammarError: Left recursion detected for rule "expr".

Slide 42

Slide 42 text

expr = expr [-+] term / term term = term [*/] factor / factor factor = '(' expr ')' / number number = [0-9]+ Left Recursion

Slide 43

Slide 43 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = [0-9]+ Left Recursion

Slide 44

Slide 44 text

var PEG = require('pegjs'); var parser = PEG.buildParser(" \ expr = term ([-+] term)* \ term = factor ([*/] factor)* \ factor = '(' expr ')' / number \ number = [0-9]+ \ "); parser.parse('1+10');

Slide 45

Slide 45 text

var PEG = require('pegjs'); var parser = PEG.buildParser(" \ expr = term ([-+] term)* \ term = factor ([*/] factor)* \ factor = '(' expr ')' / number \ number = [0-9]+ \ "); parser.parse('1+10'); [[["1"],[]],[["+",[["1","0"],[]]]]]

Slide 46

Slide 46 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = [0-9]+ Semantic Actions

Slide 47

Slide 47 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ Semantic Actions

Slide 48

Slide 48 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); } Semantic Actions

Slide 49

Slide 49 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); } Semantic Actions [["1",[]],[["+",["10",[]]]]]

Slide 50

Slide 50 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); } Semantic Actions [["1",[]],[["+",["10",[]]]]] "10"

Slide 51

Slide 51 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); }

Slide 52

Slide 52 text

{ function Number(digits) { this.nodeType = 'Number'; this.value = digits.join(''); } ... } expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); }

Slide 53

Slide 53 text

{ function Number(digits) { this.nodeType = 'Number'; this.value = digits.join(''); } ... } expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); }

Slide 54

Slide 54 text

{ function Number(digits) { this.nodeType = 'Number'; this.value = digits.join(''); } ... } expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return new Number(digits); }

Slide 55

Slide 55 text

An AltJS Language in 5 minutes

Slide 56

Slide 56 text

expr = term ([-+] term)* term = factor ([*/] factor)* factor = '(' expr ')' / number number = digits:[0-9]+ { return digits.join(''); }

Slide 57

Slide 57 text

expr = term ([-+] term)*

Slide 58

Slide 58 text

expr = term ([-+] term)* / decl

Slide 59

Slide 59 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr

Slide 60

Slide 60 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+

Slide 61

Slide 61 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9]

Slide 62

Slide 62 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 63

Slide 63 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] program = expr? ('.' [ \\n]* expr)*

Slide 64

Slide 64 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] program = expr? ('.' [ \\n]* expr)* > parser.parse('x := 2+5. y := 3')

Slide 65

Slide 65 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] program = expr? ('.' [ \\n]* expr)* > parser.parse('x := 2+5. y := 3') [[["x"]," := ",[["2",[]],[["+",["5",[]]]]]],[[".",[], [["y"]," := ",[["3",[]],[]]]]]]

Slide 66

Slide 66 text

expr = term ([-+] term)* / decl decl = ident ' := ' expr ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] program = expr? ('.' [ \\n]* expr)*

Slide 67

Slide 67 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 68

Slide 68 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; }

Slide 69

Slide 69 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 70

Slide 70 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3')

Slide 71

Slide 71 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3') ["var x = 2,,+,5,;",[[".",[],"var y = 3,,;"]]]

Slide 72

Slide 72 text

program = expr? ('.' [ \\n]* expr)* expr = term ([-+] term)* / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 73

Slide 73 text

program = expr? ('.' [ \\n]* expr)* expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 74

Slide 74 text

program = expr? ('.' [ \\n]* expr)* expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3')

Slide 75

Slide 75 text

program = expr? ('.' [ \\n]* expr)* expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3') ["var x = 2+5;",[[".",[],"var y = 3;"]]]

Slide 76

Slide 76 text

program = expr? ('.' [ \\n]* expr)* expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 77

Slide 77 text

program = e:expr? rest:(('.' [\\n ]* e:expr){ return e; })* { return [e].concat(rest).join('\n'); } expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z]

Slide 78

Slide 78 text

program = e:expr? rest:(('.' [\\n ]* e:expr){ return e; })* { return [e].concat(rest).join('\n'); } expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3')

Slide 79

Slide 79 text

program = e:expr? rest:(('.' [\\n ]* e:expr){ return e; })* { return [e].concat(rest).join('\n'); } expr = t:term rest:([-+] term)* { return flatten(t.concat(rest)); } / decl decl = id:ident ' := ' e:expr { return 'var ' + id + ' = ' + e.join('') + ';'; } ident = (digit / letter / '_')+ digit = [0-9] letter = [a-zA-Z] > parser.parse('x := 2+5. y := 3') var x = 2+5; var y = 3;

Slide 80

Slide 80 text

Resources github.com/pdubroy/jsconfeu-talk Slides: goo.gl/qs4Gna Esprima: esprima.org PEG.js: pegjs.majda.cz

Slide 81

Slide 81 text

Danke!