X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=TODO;h=0436f7c09ebbd56e483bad44a751123024297c15;hb=3b4752d25f11f16a65731195f9d3cd35ea5eb8eb;hp=354fb16e991fb95ea3a25810eb996653ef9a0248;hpb=e2ce744e73010653108898bfce3e79e5f7fa2649;p=cparser

diff --git a/TODO b/TODO
index 354fb16..0436f7c 100644
--- a/TODO
+++ b/TODO
@@ -3,12 +3,10 @@ Refactoring:
 
 Lexer:
 - Add preprocessor code.
-- proper handling of different file encodings, parsing non-ascii strings
 - We could save some space by holding source positions in a separate (somehow
   compressed table) and only storing pointers to it on the AST.
 
 Parser:
-- disallow storage class specifiers in struct/union members
 - add constant folding code (optional, ast2firm already does it)
 - Refactor code, so code to handle number values (and strings?) is an own
   module and replacable
@@ -22,15 +20,12 @@ Parser:
 
 ast2firm:
 - output source file positions for panics.
-- handle bitfield members with 0 correctly (standard says they finish the
-  current unit)
 
 Missing Errors:
+- goto over VLA declarations
 
 Missing Warnings:
 - dead assignments (int x = 5; x = bla(); -> dead assignment at x = 5;)
-- catch the if(k = b) cases, maybe require all assignments to be in parentheses
-  (but some few exceptions like toplevel, nested assignments)
 
 main/driver:
-- delete output file if we had an error
+- go through gcc manual and emulate all the gcc flags...