- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
以下代码是 lambda 演算解释器。
我无法让程序将代码结果打印到 console.log
。
class Token {
// type should be one of the valid token types listed
// below, and value is an optional value that can carry
// any extra information necessary for a given token type.
// (e.g. the matched string for an identifier)
constructor(type, value) {
this.type = type;
this.value = value;
}
};
[
'EOF', // we augment the tokens with EOF, to indicate the end of the input.
'LAMBDA',
'LPAREN',
'RPAREN',
'LCID', //lower case identifier
'DOT', //the . symbol
].forEach(token => Token[token] = token);
class Lexer {
`enter code here`
constructor(input) {
this._input = input;
this._index = 0;
this._token = undefined;
this._nextToken();
}
//Return the next char of the input or '\0' if we've reached the end
_nextChar() {
if (this._index >= this._input.length) {
return '\0';
}
return this._input[this._index++];
}
//Set this._token based on the remaining of the input
//This method is meant to be private, it doesn't return a token, just sets
//up the state for the helper functions.
_nextToken() {
let c;
do {
c = this._nextChar();
} while (/\s/.test(c));
switch (c) {
case 'λ':
case '\\':
this._token = new Token(Token.LAMBDA);
break;
case '.':
this._token = new Token(Token.DOT);
break;
case '(':
this._token = new Token(Token.LPAREN);
break;
case ')':
this._token = new Token(Token.RPAREN);
break;
case '\0':
this._token = new Token(Token.EOF);
break;
default:
if (/[a-z]/.test(c)) {
let str = '';
do {
str += c;
c = this._nextChar();
} while (/[a-zA-Z]/.test(c));
// put back the last char which is not part of the identifier
this._index--;
this._token = new Token(Token.LCID, str);
}
/*else {
this.fail();
}*/
}
}
//Assert that the next token has the given type, return it, and skip to the
//next token.
token(type) {
if (!type) {
return this._token;
}
const token = this._token;
this.match(type);
return token;
}
//throw an unexpected token error - ideally this would print the source location
/*fail() {
throw new Error(`Unexpected token at offset ${this._index}`);
}*/
//returns a boolean indicating whether the next token has the given type.
next(type) {
return this._token.type == type;
}
//Assert that the next token has the given type and skip it.
match(type) {
if (this.next(type)) {
this._nextToken();
return;
}
//console.error(`${this._index}: Invalid token: Expected '${type}' found '${this.token().type}'`);
//throw new Error('Parse Error');
}
//Same as `next`, but skips the token if it matches the expected type.
skip(type) {
if (this.next(type)) {
this._nextToken();
return true;
}
return false;
}
}
class Parser {
constructor(lexer) {
this.lexer = lexer;
}
parse() {
const result = this.term();
// make sure we consumed all the program, otherwise there was a syntax error
this.lexer.match(Token.EOF);
return result;
}
// Term ::= LAMBDA LCID DOT Term
// | Application
term() {
if (this.lexer.skip(Token.LAMBDA)) {
const id = new Identifier(this.lexer.token(Token.LCID).value);
this.lexer.match(Token.DOT);
const term = this.term();
return new Abstraction(id, term);
} else {
return this.application();
}
}
// Application ::= Atom Application'
application() {
let lhs = this.atom();
// Application' ::= Atom Application'
// | ε
while (true) {
const rhs = this.atom();
if (!rhs) {
return lhs;
} else {
lhs = new Application(lhs, rhs);
}
}
}
// Atom ::= LPAREN Term RPAREN
// | LCID
atom() {
if (this.lexer.skip(Token.LPAREN)) {
const term = this.term(Token.RPAREN);
this.lexer.match(Token.RPAREN);
return term;
} else if (this.lexer.next(Token.LCID)) {
const id = new Identifier(this.lexer.token(Token.LCID).value);
return id;
} else {
return undefined;
}
}
}
class Abstraction {
//param here is the name of the variable of the abstraction. Body is the
//subtree representing the body of the abstraction.
constructor(param, body) {
this.param = param;
this.body = body;
}
toString() {
return `(λ${this.param.toString()}. ${this.body.toString()})`;
}
}
class Application {
//(lhs rhs) - left-hand side and right-hand side of an application.
constructor(lhs, rhs) {
this.lhs = lhs;
this.rhs = rhs;
}
toString() {
return `${this.lhs.toString()} ${this.value.toString()}`;
}
}
class Identifier {
//name is the string matched for this identifier.
constructor(name) {
this.name = name;
}
toString() {
return this.name;
}
}
const isValue = node => node instanceof Abstraction;
const eval = (ast, context = {}) => {
while (true) {
if (ast instanceof Application) {
if (isValue(ast.lhs) && isValue(ast.rhs)) {
//if both sides of the application are values we can proceed and
//actually rhs value to the param name and evaluate the lhs
//abstraction's body
context[ast.lhs.param.name] = ast.rhs;
ast = eval(ast.lhs.body, context);
} else if (isValue(ast.lhs)) {
/*We should only evaluate rhs once lhs has been reduced to a value
here we have to clone the context to prevent the bindings that might
be defined while evaluating the body of rhs from leaking to the top
context. This way, once we finish evaluating rhs we automatically
"pop" the child context, and resto the original context.*/
ast.rhs = eval(ast.rhs, Object.assign({}, context));
} else {
//Keep reducing lhs until it becomes a value
ast.lhs = eval(ast.lhs, context);
}
} else if (ast instanceof Identifier) {
//Once we find an identifier, we simply replace it with the appropriate bound value.
ast = context[ast.name];
} else {
//`ast` is an abstraction, and therefore a value. That means we're done
//reducing it, and this is the result of the current evaluation.
return ast;
}
}
};
const source = '(λx. λy. x) (λx. x) (λy. y)';
// wire all the pieces together
const lexer = new Lexer(source);
const parser = new Parser(lexer);
const ast = parser.parse();
const result = eval(ast);
//stringify the resulting node and print it
console.log(result.toString());
最佳答案
class Lexer {
`enter code here`
带来错误,因为它将字符串视为意外的模板字符串。除此之外,它应该可以完美运行(按运行代码片段
将(λx.x)
写入控制台):
class Token {
// type should be one of the valid token types listed
// below, and value is an optional value that can carry
// any extra information necessary for a given token type.
// (e.g. the matched string for an identifier)
constructor(type, value) {
this.type = type;
this.value = value;
}
};
[
'EOF', // we augment the tokens with EOF, to indicate the end of the input.
'LAMBDA',
'LPAREN',
'RPAREN',
'LCID', //lower case identifier
'DOT', //the . symbol
].forEach(token => Token[token] = token);
class Lexer {
constructor(input) {
this._input = input;
this._index = 0;
this._token = undefined;
this._nextToken();
}
//Return the next char of the input or '\0' if we've reached the end
_nextChar() {
if (this._index >= this._input.length) {
return '\0';
}
return this._input[this._index++];
}
//Set this._token based on the remaining of the input
//This method is meant to be private, it doesn't return a token, just sets
//up the state for the helper functions.
_nextToken() {
let c;
do {
c = this._nextChar();
} while (/\s/.test(c));
switch (c) {
case 'λ':
case '\\':
this._token = new Token(Token.LAMBDA);
break;
case '.':
this._token = new Token(Token.DOT);
break;
case '(':
this._token = new Token(Token.LPAREN);
break;
case ')':
this._token = new Token(Token.RPAREN);
break;
case '\0':
this._token = new Token(Token.EOF);
break;
default:
if (/[a-z]/.test(c)) {
let str = '';
do {
str += c;
c = this._nextChar();
} while (/[a-zA-Z]/.test(c));
// put back the last char which is not part of the identifier
this._index--;
this._token = new Token(Token.LCID, str);
}
/*else {
this.fail();
}*/
}
}
//Assert that the next token has the given type, return it, and skip to the
//next token.
token(type) {
if (!type) {
return this._token;
}
const token = this._token;
this.match(type);
return token;
}
//throw an unexpected token error - ideally this would print the source location
/*fail() {
throw new Error(`Unexpected token at offset ${this._index}`);
}*/
//returns a boolean indicating whether the next token has the given type.
next(type) {
return this._token.type == type;
}
//Assert that the next token has the given type and skip it.
match(type) {
if (this.next(type)) {
this._nextToken();
return;
}
//console.error(`${this._index}: Invalid token: Expected '${type}' found '${this.token().type}'`);
//throw new Error('Parse Error');
}
//Same as `next`, but skips the token if it matches the expected type.
skip(type) {
if (this.next(type)) {
this._nextToken();
return true;
}
return false;
}
}
class Parser {
constructor(lexer) {
this.lexer = lexer;
}
parse() {
const result = this.term();
// make sure we consumed all the program, otherwise there was a syntax error
this.lexer.match(Token.EOF);
return result;
}
// Term ::= LAMBDA LCID DOT Term
// | Application
term() {
if (this.lexer.skip(Token.LAMBDA)) {
const id = new Identifier(this.lexer.token(Token.LCID).value);
this.lexer.match(Token.DOT);
const term = this.term();
return new Abstraction(id, term);
} else {
return this.application();
}
}
// Application ::= Atom Application'
application() {
let lhs = this.atom();
// Application' ::= Atom Application'
// | ε
while (true) {
const rhs = this.atom();
if (!rhs) {
return lhs;
} else {
lhs = new Application(lhs, rhs);
}
}
}
// Atom ::= LPAREN Term RPAREN
// | LCID
atom() {
if (this.lexer.skip(Token.LPAREN)) {
const term = this.term(Token.RPAREN);
this.lexer.match(Token.RPAREN);
return term;
} else if (this.lexer.next(Token.LCID)) {
const id = new Identifier(this.lexer.token(Token.LCID).value);
return id;
} else {
return undefined;
}
}
}
class Abstraction {
//param here is the name of the variable of the abstraction. Body is the
//subtree representing the body of the abstraction.
constructor(param, body) {
this.param = param;
this.body = body;
}
toString() {
return `(λ${this.param.toString()}. ${this.body.toString()})`;
}
}
class Application {
//(lhs rhs) - left-hand side and right-hand side of an application.
constructor(lhs, rhs) {
this.lhs = lhs;
this.rhs = rhs;
}
toString() {
return `${this.lhs.toString()} ${this.value.toString()}`;
}
}
class Identifier {
//name is the string matched for this identifier.
constructor(name) {
this.name = name;
}
toString() {
return this.name;
}
}
const isValue = node => node instanceof Abstraction;
const eval = (ast, context = {}) => {
while (true) {
if (ast instanceof Application) {
if (isValue(ast.lhs) && isValue(ast.rhs)) {
//if both sides of the application are values we can proceed and
//actually rhs value to the param name and evaluate the lhs
//abstraction's body
context[ast.lhs.param.name] = ast.rhs;
ast = eval(ast.lhs.body, context);
} else if (isValue(ast.lhs)) {
/*We should only evaluate rhs once lhs has been reduced to a value
here we have to clone the context to prevent the bindings that might
be defined while evaluating the body of rhs from leaking to the top
context. This way, once we finish evaluating rhs we automatically
"pop" the child context, and resto the original context.*/
ast.rhs = eval(ast.rhs, Object.assign({}, context));
} else {
//Keep reducing lhs until it becomes a value
ast.lhs = eval(ast.lhs, context);
}
} else if (ast instanceof Identifier) {
//Once we find an identifier, we simply replace it with the appropriate bound value.
ast = context[ast.name];
} else {
//`ast` is an abstraction, and therefore a value. That means we're done
//reducing it, and this is the result of the current evaluation.
return ast;
}
}
};
const source = '(λx. λy. x) (λx. x) (λy. y)';
// wire all the pieces together
const lexer = new Lexer(source);
const parser = new Parser(lexer);
const ast = parser.parse();
const result = eval(ast);
//stringify the resulting node and print it
console.log(result.toString());
关于javascript - 存在输出问题的 Lambda 演算解释器,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/40942779/
SELECT *, `o_cheque_request.member_id`, `o_cheque_request.wallet_id` FROM `o_cheque_request`, `o_mem
根据某一条件从数据库表中查询 『有』与『没有』,只有两种状态,那为什么在写SQL的时候,还要**SELECT count(*)**呢? 无论是刚入道的程序员新星,还是精湛沙场多年的程序员老白,都是一如
我试图找出一个文件是否存在,如果存在,验证css样式是否已经存在,如果不存在,将它们写在文件末尾... 我已经完成了这一切,但分 3 个步骤: 该文件是否存在? FileInfo fi= new Fi
我们正在开发即时消息传递应用程序,并且需要在用户的化身上用绿点显示用户 friend 的“状态”。 “状态”远远超出了“my_app_is_opened_and_on_focus”,这意味着(我猜可能
模式 Movie(title, year, director, budget, earnings) Actor(stagename, realname, birthyear) ActedIn(stag
我有一个正在尝试创建的 MySQL 触发器,但无法获得正确的语法。 触发器应该遍历一组关键字并将其与插入数据库的新帖子的标题进行匹配。如果找到匹配项,它应该将新帖子分配给该存储桶并更新存储桶的关键字集
我有 3 个表......用户、更新和碰撞。 我想向发出 api 请求的用户返回最新订单的 feed 更新,并提供显示 feed 中每个状态所需的所有数据。我还需要包括更新是否已被发出 api 请求的
我正在尝试呈现一个带有 UIView 的 UIViewController。 以下是我在 viewDidLoad 方法中尝试的代码。 //create the view controller UIVi
我正在努力弄清楚如何在不对 mysql 进行两次调用的情况下从一个表中检查两件事。 我有一个 Members 表。我想测试MemberID 列中是否存在某个值,以及PhoneNumber 列中是否存在
以下代码给出了一个没有 Do Compile 错误的循环: Loop Sheets("Snap").Rows(1).AutoFilter Field:=5, Criteria1:=List
是否可以通过检查“dig”的输出来检查域名的存在? 在绑定(bind)源中,我发现了这些常量: 0 DNS_R_NOEROR 1 DNS_R_FORMERR 2 DNS_R_SERVFAIL 3 DN
Controller 有问题 我在 Windows 上使用服务器,一切正常,但在互联网上我试图访问页面 social_apartament/beauty_life/并且找不到该页面,代码错误 404这
/** This is struct S. */ struct S(T) { static if(isFloatingPoint!T) { /// This version works
JVM 类型删除如何帮助 Clojure?没有它,Clojure 还能存在吗?如果 JVM 有具体化的类型会发生什么?也就是说,Clojure 将如何改变? 最佳答案 Clojure 根本不会有太大变
许多论文等提到对“system()”的调用是不安全且不可移植的。我不反对他们的论点。 不过,我注意到许多 Unix 实用程序都有一个等效的 C 库。如果没有,源可用于各种这些工具。 虽然许多论文和此类
在我的 Node js 应用程序中,我有一个用户登录 api。上面我在服务器端代码中创建了一个名为 customerid 的变量。现在,当用户身份验证成功时。我将他的 userid 值存储在我的 cu
我有一个工作资源管理器组,由 Ubuntu 14.04 虚拟机、网络接口(interface)、公共(public) IP 地址和存储帐户组成。我已经从这组资源中创建了一个模板。 当我尝试部署这组资源
我有一个函数createminor4(arr,锦标赛)它基本上将arr分成4组,每组8人,然后将它们一次交换到tourney 1组。从那里它插入四个{},其中有 4 个带有空数组的键。 我已经在 Ch
我有一个图表,其中有两个图例。我需要更改其中一个图例的点的大小。 我需要更改图例中“市场类型”的项目符号大小。我使用示例 here但不适用于我的图表。 我的代码如下: k <- ggplot(subs
我有 fiddle here展示我正在尝试做的事情。 我有一个动态生成的表,因此列可以按用户选择的任何顺序显示。因此,我尝试获取两个特定 header 的索引,以便可以将 CSS 类添加到这两列以供稍
我是一名优秀的程序员,十分优秀!