Check my program!

Question

Challenge

Make an error-checker in the least amount of possible bytes! If you received an HTML program as a string through standard input, your program will be able to find all the errors and return to standard output. If the program is over 2000 characters, return that as an error too.

Errors

As there has been discrepancy, I will provide the errors you can check for.

Regular:

• File too long
• Tag not closed
• Non-empty element not closed
  • XHTML self-closing will not give you any bonus.
• Entity not closed (i.e. &amp vs &)
• CSS rule with no selector attached (i.e. {color:white;} vs span {color:white;}
• CSS unclosed property-value pair (i.e. color:white vs color:white;)
• Errors with brackets (e.g. no closing bracket, rules outside brackets, etc.)
  • Each different rule about brackets counts separately.
• Undefined tag (worth x10)
• Undefined attribute (worth x4)
• Undefined CSS property (worth x10)

Let me make this clear:

You are not expected to complete all or even most of these.

Completing 7 of them would be incredible, but not necessary. Please though, try as many as you can while keeping the byte count relatively low!

Scoring

• -10 bytes for every type of SyntaxError checked (e.g. undefined tag, oversized file [see above], etc.)
• -30 bytes for every type of SyntaxError checked that returns a customized error message and line number. (for a total of -40 bytes per error)
  • You may not have a customized message less than 20char.
• -100 bytes if your program can check embedded CSS in the document for at least 3 types of errors. (this includes <element style=""> and <style></style>.
• +100 bytes if you check only 3 or less types of errors.
• ~0 bytes if your final score is negative.

As this is my first code-golf challenge, please comment if you think the scores are out of range.

Rules

• You may not use a built-in function to check for errors.
• You must check for at least 1 error type. No blank answers! :D
• You must return at minimum the number of errors in the document.
• When you post your score, you should use this Markdown format:
  Output:

  My Language, Unbonused bytes Final Score

  code here
  

  Solves:

  • First Error
  • Second Error
  • Et Cetera

  Why/How it works

       Markdown:

# My Language, <s>Unbonused bytes</s> Final Score #
    code here
**Solves:**
* First Error
* Second Error
* Et Cetera  
Why/How it works

* You may add additional strikethroughed numbers if you wish in between the two values.

Winning

After one week, the answer with the smallest number of bytes will win. If there is a tie, the answer with the most upvotes will win. If there is still a tie, I hold the divine power to choose. The winning answer will be accepted.

After the deadline, others can still post their answers, but no reward will be given.

Good Luck!

This is my first challenge, so if anything is lacking in any way, please comment. Thank you!

Answer 1

Unefunge 98, 15 9 - 10(1 error type) 36 bytes - 40(one error with detatiled message) + 100 (only one error type) = 105 99 96

This code only checks the file size.

'Ϩ#@k~"elif rellams a edivorP<NAK>"k,1q

Note that the code above contains a unicode number with code point 2000 (counted as two bytes) and an unprintable character with character code 21 (negative ackoledgement) represented by <NAK>. The error message produces is "Provide a smaller file".

Old 15-byte version:

2aaa***#@k~1q

How it works:

The programs 2aaa*** (in the old version) and 'Ϩ push the number 2000 on to the stack. Then the # character jumps over the @ and k extecutes ~, getting a char from user input, 2000 times. If eof is read, ~ reflects the program onto the @ terminating with a zero exit code. If no eof is encountered, 1q exits with exit code 1, indicating that there is one error in the input (its too big).