Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

作业2提交 #56

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
105 changes: 101 additions & 4 deletions homework/1/rename.js
Original file line number Diff line number Diff line change
Expand Up @@ -5,11 +5,96 @@ const traverse = require('../../common/traverse');
function transform(root, originName, targetName) {
// 遍历所有节点
return traverse((node, ctx, next) => {

// TODO: 作业代码写在这里
if (node.type === 'xxx') {
if (node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression') {
if (node.id) {
if (node.id.type === 'Identifier' && node.id.name === originName) {
node.id.name = targetName
}
}
if (node.params.length > 0) {
for(child in node.params) {
if (child.type === 'Identifier' && child.name === originName) {
child.name = targetName
}
}
}
}
if (node.type === 'VariableDeclarator') {
if (node.id.type === 'Identifier' && node.id.name === originName) {
node.id.name = targetName
}
}
if (node.type === 'ArrayExpression') {
if (node.elements.length > 0) {
for(child in node.elements) {
if (child.type === 'Identifier' && child.name === originName) {
child.name = targetName
}
}
}
}
if (node.type === 'ObjectExpression') {
if (node.properties.length > 0) {
node.properties.forEach(child => {
if (child.value.type === 'Identifier' && child.name === originName) {
child.name = targetName
}
})
}
}
if (node.type === 'UnaryExpression' || node.type === 'UpdateExpression') {
if (node.argument) {
if (node.argument.type === 'Identifier' && node.argument.name === originName) {
node.argument.name = targetName
}
}
}
if (node.type === 'BinaryExpression' || node.type === 'AssignmentExpression' || node.type === 'LogicalExpression') {
if (node.left.type === 'Identifier' && node.left.name === originName) {
node.left.name = targetName
}
if (node.right.type === 'Identifier' && node.right.name === originName) {
node.right.name = targetName
}
}
if (node.type === 'MemberExpression') {
if (node.object.type === 'Identifier' && node.object.name === originName) {
node.object.name = targetName
}
}
if (node.type === 'ConditionalExpression') {
if (node.test.type === 'Identifier' && node.test.name === originName) {
node.test.name = targetName
}
if (node.alternate.type === 'Identifier' && node.alternate.name === originName) {
node.alternate.name = targetName
}
if (node.consequent.type === 'Identifier' && node.consequent.name === originName) {
node.consequent.name = targetName
}
}
if (node.type === 'CallExpression' || node.type === 'NewExpression') {
if (node.callee.type === 'Identifier' && node.callee.name === originName) {
node.callee.name = targetName
}
if (node.arguments.length > 0) {
for (child in node.arguments) {
if (child.type === 'Identifier' && child.name === originName) {
child.name = targetName
}
}
}
}
if (node.type === 'SequenceExpression') {
if (node.expressions.length > 0) {
for (child in node.expressions) {
if (child.type === 'Identifier' && child.name === originName) {
child.name = targetName
}
}
}
}

// 继续往下遍历
return next(node, ctx)
})(root);
Expand All @@ -22,4 +107,16 @@ function rename(code, originName, targetName) {
return astring.generate(transform(ast, originName, targetName))
}

module.exports = rename
// const sourceCode = `
// function foo() {
// foo: while(true) {
// var foo = {
// foo: foo.foo.foo[foo + foo]
// };
// break foo;
// }
// }
// `
// const result = rename(sourceCode, 'foo', 'bar');
// console.log(result)
module.exports = rename
3 changes: 1 addition & 2 deletions homework/1/rename.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -39,6 +39,5 @@ function bar() {
`;

const result = rename(sourceCode, 'foo', 'bar');

t.deepEqual(toStandard(result), toStandard(targetCode))
})
})
90 changes: 88 additions & 2 deletions homework/2/eval.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,92 @@ const acorn = require('acorn');
function evaluate(node, env) {
switch (node.type) {
case 'Literal':
// TODO: 补全作业代码
// TODO: 补全作业代码
return node.value
case 'Identifier':
return env[node.name]
case 'BinaryExpression': {
if (node.operator === '+') {
return evaluate(node.left, env) + evaluate(node.right, env)
} else if (node.operator === '-') {
return evaluate(node.left, env) - evaluate(node.right, env)
} else if (node.operator === '*') {
return evaluate(node.left, env) * evaluate(node.right, env)
} else if (node.operator === '/') {
return evaluate(node.left, env) / evaluate(node.right, env)
} else if (node.operator === '==') {
return evaluate(node.left, env) == evaluate(node.right, env)
} else if (node.operator === '!=') {
return evaluate(node.left, env) != evaluate(node.right, env)
} else if (node.operator === '===') {
return evaluate(node.left, env) === evaluate(node.right, env)
} else if (node.operator === '!==') {
return evaluate(node.left, env) !== evaluate(node.right, env)
} else if (node.operator === '<') {
return evaluate(node.left, env) < evaluate(node.right, env)
} else if (node.operator === '<=') {
return evaluate(node.left, env) <= evaluate(node.right, env)
} else if (node.operator === '>') {
return evaluate(node.left, env) > evaluate(node.right, env)
} else if (node.operator === '>=') {
return evaluate(node.left, env) >= evaluate(node.right, env)
} else if (node.operator === '<<') {
return evaluate(node.left, env) << evaluate(node.right, env)
} else if (node.operator === '>>') {
return evaluate(node.left, env) >> evaluate(node.right, env)
} else if (node.operator === '>>>') {
return evaluate(node.left, env) >>> evaluate(node.right, env)
} else if (node.operator === '%') {
return evaluate(node.left, env) % evaluate(node.right, env)
} else if (node.operator === '|') {
return evaluate(node.left, env) | evaluate(node.right, env)
} else if (node.operator === '^') {
return evaluate(node.left, env) ^ evaluate(node.right, env)
} else if (node.operator === '&') {
return evaluate(node.left, env) & evaluate(node.right, env)
} else if (node.operator === 'in') {
return evaluate(node.left, env) in evaluate(node.right, env)
} else if (node.operator === 'instanceof') {
return evaluate(node.left, env) instanceof evaluate(node.right, env)
}
}
case 'ConditionalExpression': {
if (evaluate(node.test, env)) {
return evaluate(node.consequent, env)
} else {
return evaluate(node.alternate, env)
}
}
case 'ArrowFunctionExpression': {
return function (...args) {
const argsenv = {}
const params = node.params
for (let i = 0; i < params.length; i++) {
argsenv[params[i].name] = args[i]
}
return evaluate(node.body, {...env, ...argsenv})
}
}
case 'LogicalExpression': {
if (node.operator === '||') {
return evaluate(node.left, env) || evaluate(node.right, env)
} else if (node.operator === '&&') {
return evaluate(node.left, env) && evaluate(node.right, env)
}
}
case 'CallExpression': {
return evaluate(node.callee, env)(...node.arguments.map(arg => evaluate(arg, env)))
}
case 'ArrayExpression': {
return [...node.elements.map(arg => evaluate(arg, env))]
}
case 'ObjectExpression': {
let obj = {}
node.properties.forEach(property => {
obj[property.key.name] = evaluate(property.value, env)
})
return obj
}
}

throw new Error(`Unsupported Syntax ${node.type} at Location ${node.start}:${node.end}`);
Expand All @@ -16,4 +101,5 @@ function customerEval(code, env = {}) {
return evaluate(node, env)
}

module.exports = customerEval
const test = customerEval('(()=> {return 1})()')
module.exports = customerEval
2 changes: 1 addition & 1 deletion homework/2/eval.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -29,4 +29,4 @@ test('测试表达式 - 终极挑战', t => {
test('测试表达式 - 超纲挑战(下节课会讲)', t => {
const sourceCode = '(n => ((x => n = x)(n + 2), (y => n + y)(3)))(1)'
t.deepEqual(customerEval(sourceCode), eval(sourceCode));
})
})
Loading