d6
/
pmacs3
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

--HG-- 

branch : pmacs2
This commit is contained in:
moculus 2007-07-15 19:11:54 +00:00
parent 7e23af56e3
commit ecbabf1076
1 changed files with 5 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
IDEAS
View File

@ -1,25 +1,9 @@
2007/07/15:
Vertical split would be awesome. Also, need more fine-grained controls for
even horizontally split windows.
2007/07/15:
Rename "lexing" to "parsing" since really we have moved way beyond a simple
lexing/tokenization strategy.
2007/07/14:
The rules are currently confusingly implemented, and have poor performance when
used in deeply nested grammars.
We need to refactor lex2 so that rules have two methods:
1. match():
This method should return whether or not the rule can match the current input
that the lexer is lexing. If its result is true, the result will be passed
(along with the lexer, etc.) to the rule's lex() method. Otherwise, the next
rule will be tried.
2. lex():
This method is a generator, which is expected to return one or more tokens. In
addition to the arguments given to match() it will be passed the result of the
call to match() (which is guaranteed to be true, and will most often be a
re.Match object). As all generators, this method will raise StopIteration when
there are no more tokens to return, and will raise LexError if there are other
problems.