-prefix-free lets you use only unprefixed CSS properties everywhere. It works behind the scenes, adding the current browser’s prefix to any CSS code, only when it’s needed.
“[-prefix-free is] fantastic, top-notch work! Thank you for creating and sharing it.”
— Eric Meyer
<link> or <style> elements and adds a vendor prefix where neededstyle attribute and adds a vendor prefix where needed<link> or <style> elements, style attribute changes and CSSOM changes (requires plugin).css() method get and set unprefixed properties (requires plugin)@import-ed files is not supportedstyle attribute) won’t work in IE and Firefox < 3.6. Properties as well in Firefox < 3.6.Check this page’s stylesheet ;-)
You can also visit the Test Drive page, type in any code you want and check out how it would get prefixed for the current browser.
Just include prefixfree.js anywhere in your page. It is recommended to put it right after the stylesheets, to minimize FOUC
That’s it, you’re done!
The target browser support is IE9+, Opera 10+, Firefox 3.5+, Safari 4+ and Chrome on desktop and Mobile Safari, Android browser, Chrome and Opera Mobile on mobile.
If it doesn’t work in any of those, it’s a bug so please report it. Just before you do, please make sure that it’s not because the browser doesn’t support a CSS3 feature at all, even with a prefix.
In older browsers like IE8, nothing will break, just properties won’t get prefixed. Which wouldn’t be useful anyway as IE8 doesn’t support much CSS3 ;)
Test the prefixing that -prefix-free would do for this browser, by writing some CSS below:
Solved examples for converting NDFAs to DFAs, using Arden’s Theorem, and applying the Pumping Lemma.
[Insert link to solution manual]
: Sites like Studypool host student-uploaded versions of specific chapters and corresponding solutions. Key Features of the 3rd Edition
: Unlike many textbooks that require a separate manual, the solutions for all chapter-end exercises are included as a standard feature.
The book is structured into 12 chapters covering mathematical logic, automata theory, formal languages, Turing machines, and complexity theory. KlP MISHRA - Methodist College of Engineering & Technology
1.2 (a) Define the following terms: automata, finite automata, pushdown automata.
Solved examples for converting NDFAs to DFAs, using Arden’s Theorem, and applying the Pumping Lemma.
[Insert link to solution manual]
: Sites like Studypool host student-uploaded versions of specific chapters and corresponding solutions. Key Features of the 3rd Edition
: Unlike many textbooks that require a separate manual, the solutions for all chapter-end exercises are included as a standard feature.
The book is structured into 12 chapters covering mathematical logic, automata theory, formal languages, Turing machines, and complexity theory. KlP MISHRA - Methodist College of Engineering & Technology
1.2 (a) Define the following terms: automata, finite automata, pushdown automata.