MCPcopy Create free account
hub / github.com/codemix/htmling / peg$parseSTRING

Function peg$parseSTRING

lib/parser.js:3830–3931  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

3828 }
3829
3830 function peg$parseSTRING() {
3831 var s0, s1, s2, s3, s4;
3832
3833 peg$silentFails++;
3834 s0 = peg$currPos;
3835 if (input.charCodeAt(peg$currPos) === 34) {
3836 s1 = peg$c68;
3837 peg$currPos++;
3838 } else {
3839 s1 = peg$FAILED;
3840 if (peg$silentFails === 0) { peg$fail(peg$c69); }
3841 }
3842 if (s1 !== peg$FAILED) {
3843 s2 = peg$currPos;
3844 s3 = [];
3845 s4 = peg$parseDoubleStringCharacter();
3846 while (s4 !== peg$FAILED) {
3847 s3.push(s4);
3848 s4 = peg$parseDoubleStringCharacter();
3849 }
3850 if (s3 !== peg$FAILED) {
3851 s3 = input.substring(s2, peg$currPos);
3852 }
3853 s2 = s3;
3854 if (s2 !== peg$FAILED) {
3855 if (input.charCodeAt(peg$currPos) === 34) {
3856 s3 = peg$c68;
3857 peg$currPos++;
3858 } else {
3859 s3 = peg$FAILED;
3860 if (peg$silentFails === 0) { peg$fail(peg$c69); }
3861 }
3862 if (s3 !== peg$FAILED) {
3863 peg$reportedPos = s0;
3864 s1 = peg$c131(s2);
3865 s0 = s1;
3866 } else {
3867 peg$currPos = s0;
3868 s0 = peg$c3;
3869 }
3870 } else {
3871 peg$currPos = s0;
3872 s0 = peg$c3;
3873 }
3874 } else {
3875 peg$currPos = s0;
3876 s0 = peg$c3;
3877 }
3878 if (s0 === peg$FAILED) {
3879 s0 = peg$currPos;
3880 if (input.charCodeAt(peg$currPos) === 39) {
3881 s1 = peg$c71;
3882 peg$currPos++;
3883 } else {
3884 s1 = peg$FAILED;
3885 if (peg$silentFails === 0) { peg$fail(peg$c72); }
3886 }
3887 if (s1 !== peg$FAILED) {

Callers 2

peg$parseATTRIBUTE_VALUEFunction · 0.85

Calls 4

peg$failFunction · 0.85
peg$c131Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…