From 61b33a38c49ecdc9f443433ef500aa3f5e8f68e4 Mon Sep 17 00:00:00 2001 From: mbinary Date: Wed, 13 May 2020 23:26:23 +0800 Subject: [PATCH] Update leetcode examples --- parser/{ => leetcode_examples}/README.md | 2 +- parser/{ => leetcode_examples}/brace_expansion.py | 0 parser/{ => leetcode_examples}/calculator.py | 0 parser/{ => leetcode_examples}/lisp_expression.py | 0 parser/{ => leetcode_examples}/number_of_atoms.py | 0 5 files changed, 1 insertion(+), 1 deletion(-) rename parser/{ => leetcode_examples}/README.md (99%) rename parser/{ => leetcode_examples}/brace_expansion.py (100%) rename parser/{ => leetcode_examples}/calculator.py (100%) rename parser/{ => leetcode_examples}/lisp_expression.py (100%) rename parser/{ => leetcode_examples}/number_of_atoms.py (100%) diff --git a/parser/README.md b/parser/leetcode_examples/README.md similarity index 99% rename from parser/README.md rename to parser/leetcode_examples/README.md index 8881e67..5170975 100644 --- a/parser/README.md +++ b/parser/leetcode_examples/README.md @@ -1,6 +1,6 @@ # parser 先进行词法分析,然后进行语法分析,然后编写递归下降程序。可以将代码形成框架,词法分析每次只需要改变正则表达式部分即可,语法分析代码只需要实现语法对应的函数. -我这里列举了4个题目,都可以这样解答。 +我这里列举了4个 leetcode 题目,都可以这样解答。 * [Lisp 语法解析](#lisp-语法解析) diff --git a/parser/brace_expansion.py b/parser/leetcode_examples/brace_expansion.py similarity index 100% rename from parser/brace_expansion.py rename to parser/leetcode_examples/brace_expansion.py diff --git a/parser/calculator.py b/parser/leetcode_examples/calculator.py similarity index 100% rename from parser/calculator.py rename to parser/leetcode_examples/calculator.py diff --git a/parser/lisp_expression.py b/parser/leetcode_examples/lisp_expression.py similarity index 100% rename from parser/lisp_expression.py rename to parser/leetcode_examples/lisp_expression.py diff --git a/parser/number_of_atoms.py b/parser/leetcode_examples/number_of_atoms.py similarity index 100% rename from parser/number_of_atoms.py rename to parser/leetcode_examples/number_of_atoms.py